Bounding the fractional chromatic number of K_-free graphs

From MaRDI portal
Publication:2848565




Abstract: King, Lu, and Peng recently proved that for Deltageq4, any KDelta-free graph with maximum degree Delta has fractional chromatic number at most Deltafrac267 unless it is isomorphic to or C82. Using a different approach we give improved bounds for Deltageq6 and pose several related conjectures. Our proof relies on a weighted local generalization of the fractional relaxation of Reed's omega, Delta, chi conjecture.









This page was built for publication: Bounding the fractional chromatic number of \(K_\Delta\)-free graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2848565)