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

## Lagrangians of hypergraphsAdd to your list(s) Download to your calendar using vCal - Shoham Letzter (ETH Zurich)
- Thursday 07 March 2019, 13:00-14:00
- Watson 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. ## This talk is included in these lists:Note that ex-directory lists are not shown. |
## Other listsTopology and Dynamics Seminar Featured lists Nanoscale Physics Seminars## Other talksModule tensor categories and the Landau-Ginzburg/conformal field theory correspondence Advancing biomedical photoacoustic imaging using structured light and optical microresonators The science of the large scale heliosphere and the missions that made it possible [Colloquium:] Aperture Fever: The Extremely Large Telescope Structured Decompositions: recursive data and recursive algorithms Energy release and transport in solar eruptive events |