Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Statement
Setting (p. 4). is the supremum of the fractional chromatic number over finite unit-distance graphs .
Conjecture 1 (p. 10, quoted). ", and for all finite unit distance graphs we have ."
The first clause adds to Corollary 1 the upper bound . By Theorem 2 it is equivalent to , the form the paper also conjectures on p. 5, alongside . Since for every finite graph (p. 4), the second clause implies that every finite planar unit-distance graph has . The paper notes (p. 8) that, since was proved earlier, the conjecture would make the finitary and the measurable independence ratios of the plane differ. As support it reports (p. 14) that all children of under its search's extension rules, and a few hundred grandchildren, also have geometric fractional chromatic number .
Source. Máté Matolcsi, Imre Z. Ruzsa, Dániel Varga, Pál Zsámboki, The fractional chromatic number of the plane is at least 4, arXiv:2311.10069, read in the version dated March 28, 2025 identified on the source card, whose page numbers are used here: the conjecture on p. 10, its motivation on pp. 2, 5 and 7--8, the computational checks on p. 14.
Read depth. Claims checked: the statement was read clause by clause on the printed page. It is a conjecture; the paper offers no proof.
Bears on
- Problem 1070: the second clause implies for every , a positive answer to the particular question ; given Corollary 1, the first clause is equivalent to every finite planar unit-distance graph having independence ratio at least . A finite graph with independence ratio below would contradict both clauses; the problem page records a pending claim of such a graph. The conjecture itself has no standing as a result.