Bounding the Fractional Chromatic Number of $K_\Delta$-Free Graphs

DOI10.1137/120882068zbMath1272.05046arXiv1206.2384OpenAlexW2962876501MaRDI QIDQ2848565

Andrew D. King, Katherine Edwards

Publication date: 26 September 2013

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1206.2384

zbMATH Keywords

graph coloringfractional chromatic numberfractional coloringReed's conjecture

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items

Brooks' Theorem and Beyond, The Fractional Chromatic Number of \(\boldsymbol{K_{\Delta }}\)-Free Graphs, A superlocal version of Reed's conjecture, Unnamed Item, The fractional chromatic number of triangle-free graphs with \(\varDelta \leq 3\)