geometry-topology / Combinatorial geometry

Erdos's Question on the Independence Ratio of Unit-Distance Graphs

Erdos asked whether a finite unit-distance graph in the plane can have independence ratio below $1/4$. One exists, built on the geometric fractional chromatic number framework of Matolcsi, Ruzsa, Varga and Zsamboki plus a carefully chosen two-vertex augmentation.

20Significance / 100
1Frontier events
0Verification tasks
0Recorded attempts

Temporal state

Current frontier

No reconciled state yet.

Append-only history

Frontier timeline

geometry-topologyJun 26, 2026Significance 20/100Registry: unreviewed

Erdos's Question on the Independence Ratio of Unit-Distance Graphs

Prior state unknownproved

Erdos asked whether a finite unit-distance graph in the plane can have independence ratio below $1/4$. One exists, built on the geometric fractional chromatic number framework of Matolcsi, Ruzsa, Varga and Zsamboki plus a carefully chosen two-vertex augmentation.

SourceReplayReproducedFormal proofStatement auditExternal checkExpert reviewPeer review

Research memory

Claims and attempts

Scoped claims

Source authenticated

Erdos asked whether a finite unit-distance graph in the plane can have independence ratio below $1/4$. One exists, built on the geometric fractional chromatic number framework of Matolcsi, Ruzsa, Varga and Zsamboki plus a carefully chosen two-vertex augmentation.

Recorded attempts

Evidence graph

Connected research record

No public relationships recorded yet.