Topological lower bounds for the chromatic number: A hierarchy
Jiri Matousek, G\"unter M. Ziegler

TL;DR
This paper explores topological methods to establish lower bounds for the chromatic number of graphs, comparing various bounds and introducing a simpler, functorial box complex that aligns with Lovász's original approach.
Contribution
It demonstrates that topological bounds are nearly linearly ordered in strength and introduces a new, simpler, functorial box complex consistent with Lovász's neighborhood complex.
Findings
Topological bounds are almost linearly ordered by strength.
A new, simpler functorial box complex is introduced.
Every finite graph can be represented as a generalized Kneser graph.
Abstract
This paper is a study of ``topological'' lower bounds for the chromatic number of a graph. Such a lower bound was first introduced by Lov\'asz in 1978, in his famous proof of the \emph{Kneser conjecture} via Algebraic Topology. This conjecture stated that the \emph{Kneser graph} , the graph with all -element subsets of as vertices and all pairs of disjoint sets as edges, has chromatic number . Several other proofs have since been published (by B\'ar\'any, Schrijver, Dolnikov, Sarkaria, Kriz, Greene, and others), all of them based on some version of the Borsuk--Ulam theorem, but otherwise quite different. Each can be extended to yield some lower bound on the chromatic number of an arbitrary graph. (Indeed, we observe that \emph{every} finite graph may be represented as a generalized Kneser graph, to which the above bounds apply.) We show that these…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsImage Retrieval and Classification Techniques · Graph Labeling and Dimension Problems
