1-subdivisions, fractional chromatic number and Hall ratio
Preprint
Abstract
The Hall ratio of a graph G is the maximum of |V(H)|/alpha(H) over all subgraphs H of G. Clearly, the Hall ratio of a graph is a lower bound for the fractional chromatic number. It has been asked whether conversely, the fractional chromatic number is upper bounded by a function of the Hall ratio. We answer this question in negative, by showing two results of independent interest regarding 1-subdivisions (the 1-subdivision of a graph is obtained by subdividing each edge exactly once). * For every c > 0, every graph of sufficiently large average degree contains as a subgraph the 1-subdivision of a graph of fractional chromatic number at least c. * For every d > 0, there exists a graph G of average degree at least d such that every graph whose 1-subdivision appears as a subgraph of G has Hall ratio at most 18. We also discuss the consequences of these results in the context of graph classes with bounded expansion.Keywords
All Related Versions
This publication has 8 references indexed in Scilit:
- Counterexamples to a Conjecture of Harris on Hall RatioSIAM Journal on Discrete Mathematics, 2022
- Some Results on Chromatic Number as a Function of Triangle CountSIAM Journal on Discrete Mathematics, 2019
- The fractional chromatic number, the Hall ratio, and the lexicographic productDiscrete Mathematics, 2009
- Grad and classes with bounded expansion I. DecompositionsEuropean Journal of Combinatorics, 2008
- Hall ratio of the Mycielski graphsDiscrete Mathematics, 2006
- Relations among the fractional chromatic, choice, Hall, and Hall-condition numbers of simple graphsDiscrete Mathematics, 2001
- Dense Graphs without 3-Regular SubgraphsJournal of Combinatorial Theory, Series B, 1995
- Kneser's conjecture, chromatic number, and homotopyJournal of Combinatorial Theory, Series A, 1978