The fractional chromatic bound for triangle-free degenerate graphs
The fractional chromatic bound for triangle-free degenerate graphs
From papers
Let be a triangle-free graph that is -degenerate, meaning every subgraph of has a vertex of degree at most . The fractional chromatic bound. Then
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.
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Sources & referencesView supporting material
Primary source
David G. Harris, “Some results on chromatic number as a function of triangle count”, arXiv:1604.00438 (2019).
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.