- This event has passed.

# Casey Tompkins, 3-uniform hypergraphs avoiding a cycle of length four

## March 30 Tuesday @ 4:30 PM - 5:30 PM KST

Room B232,
IBS (기초과학연구원)

We show that that the maximum number of of edges in a $3$-uniform hypergraph without a Berge-cycle of length four is at most $(1+o(1)) \frac{n^{3/2}}{\sqrt{10}}$. This improves earlier estimates by Győri and Lemons and by Füredi and Özkahya. Joint work with Ergemlidze, Győri, Methuku, Salia.