Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Statement
Setting (p. 2). Put , with the constant the paper chooses. A sequence of sets of size is -spread if, for every nonempty , at most elements of the sequence contain . The paper states its results for sequences, which may repeat sets (footnote 2, p. 2), and notes that a similar notion was first used by Talagrand (footnote 1, p. 2).
Lemma 2 (p. 2, quoted). "If a sequence of more than sets of size is -spread, then the sequence must contain disjoint sets."
The paper proves it "for an appropriate choice of " (p. 2); the logarithm is to base 2 (p. 3).
The sunflower conjecture remark (p. 2). The paper says that, as far as it knows, Lemma 2 may hold even with , and that such a strengthening would imply the sunflower conjecture of Erdős and Rado.
Source. Anup Rao, Coding for sunflowers, Discrete Analysis 2020:2, 8 pp., doi:10.19086/da.11887 (arXiv:1909.04774v2). Lemma 2 and the remark are on p. 2, the proof on pp. 2--3. Card: Rao 2020.
Read depth. Claims checked: the definition of an -spread sequence, the statement and the remark were read clause by clause on the printed page. The proof was read for structure only.
Proof pointer
Pages 2--3. Apply Lemma 4 with and , so that . Split uniformly at random into parts , each of size at least . By symmetry and linearity of expectation, , so for some fixed partition the sum vanishes for every ; then each contains a set of the sequence, and these sets are pairwise disjoint. Lemma 4 asks for , which satisfies when ; the paper does not comment on smaller .
Dependencies
Lemma 4 (p. 2), with Definition 3 (p. 2).
Bears on
- Problem 20: Lemma 2 yields Theorem 1, which does not answer the problem. The paper's remark says that Lemma 2 with would imply the Erdős--Rado sunflower conjecture, which is the affirmative answer to the problem's question; the paper does not prove that strengthening.