University of Cambridge > Talks.cam > Combinatorics Seminar > Large hypergraphs without tight cycles

Large hypergraphs without tight cycles

Add to your list(s) Download to your calendar using vCal

  • UserMr B. Janzer (Cambridge)
  • ClockThursday 03 February 2022, 14:30-15:30
  • HouseMR12.

If you have a question about this talk, please contact ibl10.

An r-uniform tight cycle of length k>r is a hypergraph with vertices v_1,.,v_k and hyperedges {v_i,v_{i+1},.,v_{i+r-1}} (for all i), with the indices taken modulo k. Sós, and independently Verstraëte, asked the following question: how many edges can there be in an n-vertex r-uniform hypergraph if it contains no tight cycles of any length? In this talk I will review some known results, and present recent progress on this problem.

This talk is part of the Combinatorics Seminar series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

© 2006-2022 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity