Bounding the fractional chromatic number of K_-free graphs

Abstract: King, Lu, and Peng recently proved that for

D e l t a g e q 4

, any

K_{D} e l t a

-free graph with maximum degree

D e l t a

has fractional chromatic number at most

D e l t a - f r a c 267

unless it is isomorphic to

or

C_{8}^{2}

. Using a different approach we give improved bounds for

D e l t a g e q 6

and pose several related conjectures. Our proof relies on a weighted local generalization of the fractional relaxation of Reed's

o m e g a

,

D e l t a

,

c h i

conjecture.

Recommendations

Cited In (7)

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