Conjecture on fractional chromatic number versus edges in triangle-free graphs
Let be a triangle-free graph with edges, and let denote its fractional chromatic number. Edge-based fractional chromatic-number conjecture. As , every such graph satisfies
The conjecture is presented as an analogue of Shearer's bound, giving a sharper fractional colouring prediction in terms of the number of edges.
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.