Bollobás–Leader–Malvenuto conjecture on Turán densities of daisies
Statement
For integers and , an -uniform -daisy is the collection of sets
where , , and . Its Turán density is
where is the maximum size of a family of -element subsets of containing no copy of .
Bollobás–Leader–Malvenuto conjecture. For all ,
This conjecture was made by Bollobás, Leader and Malvenuto, and independently by Bukh. It remains open even for ; for comparison, the first unknown case is , for which the known lower bound is .
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.