Daisies and Other Turan Problems
Bela Bollobas, Imre Leader, Claudia Malvenuto
TL;DR
This paper explores conjectures on extremal densities of daisy-free hypergraph families, linking them to Turan problems in hypercubes and highlighting their intrinsic mathematical interest.
Contribution
It introduces new conjectures on daisy-free families and connects these to Turan problems in hypercube structures, offering fresh perspectives in extremal combinatorics.
Findings
Proposes conjectures on daisy-free hypergraph densities
Establishes connections between daisy problems and hypercube Turan problems
Highlights the natural significance of these questions in combinatorics
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsLimits and Structures in Graph Theory · Graph theory and applications · Analytic Number Theory Research