arXiv · 2611.19256
Independent Sets in $C_4$-Free Planar Graphs: Sharp Claw-Free Bounds and Structural Reductions
Abstract
For every claw-free $C_4$-free planar graph, we prove the sharp weighted bound $α_w(G)\ge (10/31)\sum_v w(v)$, equivalently $χ_f(G)\le31/10$. The proof uses a line-graph representation and the matching polytope; the exceptional small roots are excluded analytically by planar duality and degree-four neighborhood analysis in triangulations. We also prove that, in every $2$-connected $C_4$-free graph of minimum degree at least four, an independent selection of claw centers leaves a compatible subgraph of noncenters with fractional chromatic number at most three; planarity is not required. We apply these results to the conjecture $α(G)\ge5|V(G)|/16$. A minimum-order counterexample without degree-three vertices has at least forty-nine vertices. When all degree-three components of a minimum counterexample are triangle trees, we derive exact boundary states and a joint matching formula. We identify the remaining deficiency estimate and the additional component types that must be addressed to extend this approach. The general conjecture remains open.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Zhou Guofei. 2026-11-14. Independent Sets in $C_4$-Free Planar Graphs: Sharp Claw-Free Bounds and Structural Reductions. https://searcharxiv.com/abs/2611.19256
Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Searcharxiv by Indiciae: BibTeX · RIS.