Conjecture on fractional chromatic number of triangle-free graphs
Let be a triangle-free graph on vertices, and let denote its fractional chromatic number. Fractional chromatic-number conjecture. As , every such graph satisfies
The paper notes that the corresponding proved bound has leading constant and conjectures that this factor can be improved for fractional chromatic number.
References
- Wouter Cames van Batenburg, Rémi de Joannis de Verclos, Ross J. Kang and François Pirot, “Bipartite induced density in triangle-free graphs”, arXiv:1808.02512 (2020).
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.