UVictoria Discrete Math Seminar: Maya Sankar

I will discuss several recent results on the Turán density of long cycle-like hypergraphs. These results (due to Kamčev–Letzter–Pokrovskiy, Balogh–Luo, and myself) all follow a similar framework, and I will outline a general strategy to prove Turán-type results for tight cycles in larger uniformities or for other "cycle-like" hypergraphs.

One key ingredient in this framework, which I hope to prove in full, is a hypergraph analogue of the statement that a graph has no odd closed walks if and only if it is bipartite. More precisely, for various classes C of "cycle-like" r-uniform hypergraphs — including, for any k, the family of tight cycles of length k modulo r — we equiivalently characterize C-hom-free hypergraphs as those admitting a certain type of coloring of (r-1)-tuples of vertices. This provides a common generalization of results due to Kamčev–Letzter–Pokrovskiy and Balogh–Luo.