Wiki
Wiki

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 r(p,k)=αplog⁡(pk)r(p,k)=\alpha p\log(pk), with α\alpha the constant the paper chooses. A sequence S1,…,Sℓ⊂[n]S_1,\ldots,S_\ell\subset[n] of sets of size kk is rr-spread if, for every nonempty Z⊂[n]Z\subset[n], at most rk−∣Z∣r^{k-|Z|} elements of the sequence contain ZZ. 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 r(p,k)kr(p,k)^k sets of size kk is r(p,k)r(p,k)-spread, then the sequence must contain pp disjoint sets."

The paper proves it "for an appropriate choice of α\alpha" (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 r(p,k)=O(p)r(p,k)=O(p), 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 rr-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 γ=1/(2p)\gamma=1/(2p) and ε=1/p\varepsilon=1/p, so that r(k,γ,ε)=r(p,k)r(k,\gamma,\varepsilon)=r(p,k). Split [n][n] uniformly at random into pp parts W1,…,WpW_1,\ldots,W_p, each of size at least ⌊n/p⌋≥γn\lfloor n/p\rfloor\ge\gamma n. By symmetry and linearity of expectation, E[∣χ(X,W1)∣+⋯+∣χ(X,Wp)∣]<εp=1\mathbb E\bigl[|\chi(X,W_1)|+\cdots+|\chi(X,W_p)|\bigr]<\varepsilon p=1, so for some fixed partition the sum vanishes for every XX; then each WiW_i contains a set of the sequence, and these pp sets are pairwise disjoint. Lemma 4 asks for ε<1/2\varepsilon<1/2, which ε=1/p\varepsilon=1/p satisfies when p≥3p\ge3; the paper does not comment on smaller pp.

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 r(p,k)=O(p)r(p,k)=O(p) 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.