Clifton–Salia plane-saturation-ratio conjectures
For nonnegative integers , let be the class of planar graphs such that, for each and each vertex set , at most vertices of degree satisfy , with meaning that vertices of degree are forbidden. For every graph with at least one edge, the plane-saturation ratio satisfies , where and the minimum ranges over plane-saturated subgraphs of . The case is the minimum-degree- conjecture.
References
- The Plane-Saturation Ratio of Planar Graphs — arXiv — Qing Cui, Shengjin Ji
Source: arXiv
Progress summary
A 2026 preprint claims to prove both conjectures, but the claim has not been independently checked.
The Clifton–Salia conjectures ask for sharp lower bounds on the plane-saturation ratio in broad classes of planar graphs. Clifton and Salia formulated the all-parameter extension as Conjecture 4.1 and the minimum-degree- case as Conjecture 4.2 in 2024.
Known results
- Clifton–Salia (2024): when has no degree- or degree- twins.
- Clifton–Salia (2024): except for ; the all-parameter extension remained conjectural.
- Barát, Blázsik, Keszegh, and Zheng (2025): for sufficiently large maximal planar graphs, the ratio lies in , without proving the conjecture.
October 2026 claimed resolution
Qing Cui and Shengjin Ji’s preprint claims for every graph in the stated degree-multiplicity classes, which would settle both Clifton–Salia conjectures. The claim is reported from an unrefereed preprint and has not been independently corroborated.
Current status (as of October 2026): the conjectures are claimed solved by Cui and Ji, but that resolution remains unverified; the earlier partial results and the asymptotic maximal-planar bounds are established.
Solutions 0
No solutions have been posted yet.