ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let r≥1r\geq 1 and let XX be a finite ground set. Let F\mathcal{F} be a ww-set system, meaning that every member has size at most ww. A random δ\delta-fraction coloring colors each element of XX red independently with probability δ\delta, leaving the other elements uncolored. An rr-sunflower is a collection of rr sets whose pairwise intersections equal their common intersection; its petals are the sets after removing that common intersection. Monochromatic sunflower conjecture. For every δ>0\delta>0, there exists a constant K=K(r,δ)K=K(r,\delta) such that if ∣F∣≥Kw|\mathcal{F}|\geq K^w, then with high probability the family contains an rr-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 KwK^w 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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.