Results 1 
2 of
2
On topological relaxations of chromatic conjectures
"... 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 ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
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 BehzadVizing 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 [41], our main concern here is that the socalled 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.
ProjectTeam Mascotte Méthodes Algorithmiques, Simulation et Combinatoire pour l’OpTimisation des
"... c t i v it y e p o r t 2009 Table of contents ..."
(Show Context)