Daisies and Other Turan Problems

2011/05/08 by Béla Bollobás, Bollobas, Bela, Imre Leader +3 · 1 citation
Mathematics · #Limits and Structures in Graph Theory #Graph theory and applications #Analytic Number Theory Research

paper · pdf · doi:10.48550/arxiv.1105.1553

Abstract

We make some conjectures about extremal densities of daisy-free families, where a `daisy' is a certain hypergraph. These questions turn out to be related to some Turan problems in the hypercube, but they are also natural in their own right.

Citations

• On extremal problems of graphs and generalized graphs

Cited by

• Triple systems with bounded matching number: some constructions and exact Turán number

Related

• Lower bounds for the Turán densities of daisies
• C10 Has Positive Turán Density in the Hypercube
• A hypergraph Turán problem with no stability
• Palettes determine uniform Turán density
• Turán density of long tight cycle minus one hyperedge