Extremal set theory and hypergraphs

Largest or smallest families of finite sets under intersection, union or containment constraints, and hypergraphs (uniform set systems) studied by Turán, colouring, matching and covering parameters; problems about graphs go to GraphTheory.

• Intersecting families, Sperner theory and sunflowers
• Hypergraph Turán problems
• Hypergraph colouring, matchings and covers
• Uniform hypergraphs

The dependency explorer needs JavaScript and its graph data.

Download the complete graph data.