Turán numbers of some complete degenerate hypergraphs

Series
Graph Theory Seminar
Time
Tuesday, October 5, 2021 - 11:00am for 1 hour (actually 50 minutes)
Location
Skiles 005
Speaker
Xiaofan Yuan – Georgia Institute of Technology – xyuan@gatech.eduhttps://people.math.gatech.edu/~xyuan62/
Organizer
Anton Bernshteyn

Please Note: Note the unusual time!

Let K(r)s1,s2,,sr be the complete r-partite r-uniform hypergraph and ex(n,K(r)s1,s2,,sr) be the maximum number of edges in any n-vertex K(r)s1,s2,,sr-free r-uniform hypergraph. It is well-known in the graph case that ex(n,Ks,t)=Θ(n21/s) when t is sufficiently larger than s. We generalize the above to hypergraphs by showing that if sr is sufficiently larger than s1,s2,,sr1 then ex(n,K(r)s1,s2,,sr)=Θ(nr1s1s2sr1). This is joint work with Jie Ma and Mingwei Zhang.