Box complexes, neighborhood complexes, and the chromatic number

Details Box complexes, neighborhood complexes, and the chromatic number Box complexes, neighborhood complexes, and the chromatic number

2003-10-21

arxiv.org/abs/math/0310339v1

Journal of Combinatorial Theory, Series A 108 (2004), pp. 159-168.

Mathematics

Combinatorics

8 pages, 1 figure

Scientific paper

Lovasz's striking proof of Kneser's conjecture from 1978 using the Borsuk--Ulam theorem provides a lower bound on the chromatic number of a graph. We introduce the shore subdivision of simplicial complexes and use it to show an upper bound to this topological lower bound and to construct a strong Z_2-deformation retraction from the box complex (in the version introduced by Matousek and Ziegler) to the Lovasz complex. In the process, we analyze and clarify the combinatorics of the complexes involved and link their structure via several ``intermediate'' complexes.

Affiliated with

Also associated with

No associations

Rating

Box complexes, neighborhood complexes, and the chromatic number 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 Box complexes, neighborhood complexes, and the chromatic number, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Box complexes, neighborhood complexes, and the chromatic number will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-510187