Bounding the fractional chromatic number of K_-free graphs
From MaRDI portal
Publication:2848565
Abstract: King, Lu, and Peng recently proved that for , any -free graph with maximum degree has fractional chromatic number at most unless it is isomorphic to or . Using a different approach we give improved bounds for and pose several related conjectures. Our proof relies on a weighted local generalization of the fractional relaxation of Reed's , , conjecture.
Recommendations
- The fractional chromatic number of triangle-free graphs with \(\varDelta \leq 3\)
- On bounding the difference of the maximum degree and the clique number
- Fractional chromatic number, maximum degree, and girth
- Bounding \(\chi\) by a fraction of \(\Delta\) for graphs without large cliques
- An Upper Bound on the Fractional Chromatic Number of Triangle-Free Subcubic Graphs
Cited in
(7)- The Fractional Chromatic Number of \(\boldsymbol{K_{\Delta }}\)-Free Graphs
- Fractional coloring with local demands and applications to degree-sequence bounds on the independence number
- scientific article; zbMATH DE number 7641240 (Why is no real title available?)
- The fractional chromatic number of triangle-free graphs with \(\varDelta \leq 3\)
- A superlocal version of Reed's conjecture
- Fractional chromatic number, maximum degree, and girth
- Brooks' Theorem and Beyond
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)