Fractional colorings of cubic graphs with large girth
From MaRDI portal
Publication:3225133
DOI10.1137/100812082zbMath1237.05080DBLPjournals/siamdm/KardosKV11arXiv1010.3415OpenAlexW1985591473WikidataQ57601393 ScholiaQ57601393MaRDI QIDQ3225133
František Kardoš, Jan Volec, Daniel Král'
Publication date: 15 March 2012
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1010.3415
Random graphs (graph-theoretic aspects) (05C80) Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (7)
Properties of regular graphs with large girth via local algorithms ⋮ Invariant Gaussian processes and independent sets on regular graphs of large girth ⋮ Independence ratio and random eigenvectors in transitive graphs ⋮ The Fractional Chromatic Number of \(\boldsymbol{K_{\Delta }}\)-Free Graphs ⋮ Improved replica bounds for the independence ratio of random regular graphs ⋮ Cubic graphs with small independence ratio ⋮ Fractional Chromatic Number, Maximum Degree, and Girth
This page was built for publication: Fractional colorings of cubic graphs with large girth