Discrete Lunch‎ > ‎

The polytope of the Turan hypergraph problem -- Annie Raymond

posted Oct 26, 2013, 11:38 PM by Dirk Oliver Theis   [ updated Oct 26, 2013, 11:38 PM ]
Mon Oct 21, our visitor from Berlin, Annie Raymond, talks about Linear Programming based approaches to fundamental questions in extremal combinatorics.

The Turan hypergraph problem asks to find the maximum number of hyperedges in an a-clique-free r-uniform hypergraph on n vertices.  In her talk, she modelized the problem as an integer program and presented some inequalities and facets of the underlying polytope.