Asymptotic independence-ratio conjecture for finite unit-distance graphs
Let denote the minimum independence number among -vertex unit-distance graphs in the plane, and let be the supremum of the upper densities of measurable subsets of containing no two points at distance . Asymptotic independence-ratio conjecture.
Although the strict inequality is now solved, the problem of accurately estimating remains wide open, including this conjectured asymptotic relation.
References
- Ákos Dúcz and Dániel Varga, “A unit-distance graph in the plane with independence ratio below 1/4”, arXiv:2606.28157 (2026).
Progress summary
Never refreshed
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.