The daisy density conjecture
Let . For a set , write for its -subsets. An -graph is a subset of . Given an -set and a disjoint -set , the -daisy is the -uniform hypergraph consisting of all -sets satisfying . Let denote its limiting Turán density. The daisy density conjecture.
This is the paper's fundamental extremal question about daisy-free uniform hypergraphs; the conjecture concerns the asymptotic density as the uniformity grows, while even the exact density for is presented as unknown.
References
Status
- Refuted: Noga Alon and Joel H. Spencer. Turán densities for daisies and hypercubes (Bulletin of the London Mathematical Society, 2024) https://doi.org/10.1112/blms.13171
Source: Bela Bollobas, Imre Leader and Claudia Malvenuto, “Daisies and Other Turan Problems”, arXiv:1105.1553 (2011).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.