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

  Browse A-Z

Log in

University Account External (via Google)

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹ️ Information

Large hypergraphs without tight cycles

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 .

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:

Note that ex-directory lists are not shown.

Other lists

The obesity epidemic: Discussing the global health crisis Melville Laboratory Seminars Seminar Room 5, Cripps Court, Magdalene College

Other talks

Claudia Ribeiro Almeida, Group Leader, Babraham Institute Title TBC Title to be confirmed Climate, uncertainty, and the slippery measurement of Antarctic ice Bigger Picture Talk: Developing future marine engines running on ammonia and other green fuels External Seminar - Michael Raissig TBC
 

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