Monochromatic sunflower conjecture
Statement
Let and let be a finite ground set. Let be a -set system, meaning that every member has size at most . A random -fraction coloring colors each element of red independently with probability , leaving the other elements uncolored. An -sunflower is a collection of sets whose pairwise intersections equal their common intersection; its petals are the sets after removing that common intersection. Monochromatic sunflower conjecture. For every , there exists a constant such that if , then with high probability the family contains an -sunflower whose petals are all red.
This conjecture is a monochromatic strengthening of the sunflower phenomenon. The source presents it as another variant related to the rainbow sunflower conjecture and does not state a resolution of the bound.
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.