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 listsContemporary History Seminar Cold atoms Algebra Reading Group on Sporadic Groups## Other talksQuantum simulations using ultra cold ytterbium Ultrafast, all-optical, and highly efficient imaging of molecular chirality Metamaterials for light-matter interaction studies Disorder relevance for non-convex random gradient Gibbs measures in d=2 Geometry of alternating projections in metric spaces with bounded curvature Modelling uncertainty in image analysis. |