University of Birmingham > Talks@bham > Combinatorics and Probability Seminar > Lagrangians of hypergraphs

Lagrangians of hypergraphs

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

  • UserShoham Letzter (ETH Zurich)
  • ClockThursday 07 March 2019, 13:00-14:00
  • HouseWatson LTB.

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

Frankl and F├╝redi conjectured (1989) that any r-uniform hypergraph, whose edges form an initial segment of length m in the colex ordering, maximises the Lagrangian among all r-uniform hypergraphs with m edges, for all r and m. We prove this conjecture for r=3 (and large m), and disprove it for larger r (and a wide range of m). In the talk I will explain the notion of Lagrangians and focus on the counterexamples to the conjecture.

This talk is part of the Combinatorics and Probability Seminar series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

Talks@bham, University of Birmingham. Contact Us | Help and Documentation | Privacy and Publicity.
talks@bham is based on talks.cam from the University of Cambridge.