The fractional chromatic bound for triangle-free degenerate graphs

At least 9 years old · documented by

Let GG be a triangle-free graph that is dd-degenerate, meaning every subgraph of GG has a vertex of degree at most dd. The fractional chromatic bound. Then

χf(G)≲dlog⁡d.\chi_{\mathrm{f}}(G)\lesssim\frac{d}{\log d}.

The claim follows in the source from the proposed Hall-ratio conjecture together with a triangle-free coloring estimate; it is therefore presented as a conjectural consequence rather than proved independently there.

References

Primary source

David G. Harris, “Some results on chromatic number as a function of triangle count”, arXiv:1604.00438 (2019).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.