betaFeedback

WorksMathematics

Independent Sets in C4C_4-Free Planar Graphs: Sharp Claw-Free Bounds and Structural Reductions

Abstract

For every claw-free C4C_4-free planar graph, we prove the sharp weighted bound αw(G)≥(10/31)∑vw(v)α_w(G)\ge (10/31)\sum_v w(v), equivalently χf(G)≤31/10χ_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 22-connected C4C_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)≥5∣V(G)∣/16α(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.

Paper details

vlnc:W_4y7p28dg
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
arXiv nonexclusive license
Usage

views · 0

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Mathematics

Not recorded for this paper

View statement
Looking for related papers…