Abstract
Various simplicial complexes can be associated with a graph. Box complexes form an important family of such simplicial complexes and are especially useful for providing lower bounds on the chromatic number of the graph via some of their topological properties. They provide thus a fascinating topic mixing topology and discrete mathematics. This paper is intended to provide an up-do-date survey on box complexes. It is based on classical results and recent findings from the literature, but also establishes new results improving our current understanding of the topic, and identifies several challenging open questions.
Original language | English |
---|---|
Article number | 114422 |
Journal | Discrete Mathematics |
Volume | 348 |
Issue number | 6 |
DOIs | |
Publication status | Published - Jun 2025 |
Keywords
- Box complexes
- Coloring
- Graph theory
- Topology
ASJC Scopus subject areas
- Theoretical Computer Science
- Discrete Mathematics and Combinatorics