On topological relaxations of chromatic conjectures

Details On topological relaxations of chromatic conjectures On topological relaxations of chromatic conjectures

2010-02-24

arxiv.org/abs/1002.4536v1

European Journal of Combinatorics, 31/8 (2010) 2110-2119

Mathematics

Combinatorics

Scientific paper

10.1016/j.ejc.2010.06.001

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 an earlier paper of the first author with G. Tardos, 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.

Affiliated with

Also associated with

No associations

Rating

On topological relaxations of chromatic conjectures does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On topological relaxations of chromatic conjectures, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On topological relaxations of chromatic conjectures will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-260713