WorksMathematics
Independent Sets in -Free Planar Graphs: Sharp Claw-Free Bounds and Structural Reductions
Abstract
For every claw-free -free planar graph, we prove the sharp weighted bound , equivalently . 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 -connected -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 . 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.