Large hypergraphs without tight cycles

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

• Mr B. Janzer (Cambridge)
• Thursday 03 February 2022, 14:30-15:30
• MR12.

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.

This talk is included in these lists:

• All CMS events
• All Talks (aka the CURE list)
• CMS Events
• Combinatorics Seminar
• DPMMS Lists
• DPMMS Pure Maths Seminar
• DPMMS info aggregator
• DPMMS lists
• Hanchen DaDaDash
• Interested Talks
• MR12
• School of Physical Sciences
• bld31

Note that ex-directory lists are not shown.