Casey Tompkins gave a talk on the maximum number of edges in 3-uniform hypergraphs without Berge cycles of length 4 at the Discrete Math Seminar

On March 30, 2021, Casey Tompkins from the IBS Discrete Mathematics Group gave a talk at the Discrete Math Seminar on an upper bound for the maximum number of edges in a 3-uniform hypergraph having no Berge cycles of length 4. The title of his talk was “3-uniform hypergraphs avoiding a cycle of length four“.