Name
Abstract | ||
|---|---|---|
There are several famous unsolved conjectures about the chromatic number that were relaxed and already proven to hold for the fractional chromatic number. We discuss similar relaxations for the topological lower bound(s) of the chromatic number. In particular, we prove that such a relaxed version is true for the Behzad-Vizing conjecture and also discuss the conjectures of Hedetniemi and of Hadwiger from this point of view. For the latter, a similar statement was already proven in Simonyi and Tardos (2006) [41], our main concern here is that the so-called odd Hadwiger conjecture looks much more difficult in this respect. We prove that the statement of the odd Hadwiger conjecture holds for large enough Kneser graphs and Schrijver graphs of any fixed chromatic number. |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1016/j.ejc.2010.06.001 | Eur. J. Comb. |
Keywords | Field | DocType |
lower bound | Discrete mathematics,Graph,Topology,Hadwiger conjecture (graph theory),Combinatorics,Chromatic scale,Upper and lower bounds,Lonely runner conjecture,Conjecture,Mathematics | Journal |
Volume | Issue | ISSN |
31 | 8 | European Journal of Combinatorics, 31/8 (2010) 2110-2119 |
Citations | PageRank | References |
4 | 0.72 | 24 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Gábor Simonyi | 1 | 249 | 29.78 |
| Ambrus Zsbán | 2 | 12 | 1.98 |