Can I read Graph Colorings, Spaces of Edges and Spaces of Circuits on EtoBox?

Graph Colorings, Spaces of Edges and Spaces of Circuits by Carsten Schultz is a Mathematics article available to read on EtoBox.

What is Graph Colorings, Spaces of Edges and Spaces of Circuits about?

By Lovász' proof of the Kneser conjecture, the chromatic number of a graph G is bounded from below by the index of the Z 2 -space Hom(K 2 , G) plus two. We show that the cohomological index of Hom(K 2 , G) is also greater than the cohomological index of the Z 2 -space Hom(C 2r+1 , G) for r 1. This gives a new and simple proof of the strong form of the graph coloring theorem by Babson and Kozlov, which had been conjectured by Lovász, and at the same time shows that it never gives a stronger bound than can be obtained by Hom(K 2 , G). The proof extends ideas introduced by Živaljević in a previous elegant proof of a special case. We then generalize the arguments and obtain conditions under which corresponding results hold for other graphs in place of C 2r+1 . This enables us to find an infinite family of test graphs of chromatic number 4 among the Kneser graphs. Our main new result is a description of the Z 2 -homotopy type of the direct limit of the system of all the spaces Hom(C 2r+1 , G) in terms of the Z 2 -homotopy type of Hom(K 2 , G). A corollary is that the coindex of Hom(K 2 , G) does not exceed the coindex of Hom(C 2r+1 , G) by more then one if r is chosen sufficiently large

Who reads Graph Colorings, Spaces of Edges and Spaces of Circuits?

Author

Carsten Schultz

Publisher

Elsevier Science; Elsevier ; Elsevier Inc.; Elsevier BV (ISSN 0001-8708)

Published

2009

Language

EN

Field

Mathematics (Physical Sciences)