On the topological lower bound for the multichromatic number

DOI10.1016/j.disc.2009.12.024zbMath1195.05025OpenAlexW1988025996MaRDI QIDQ965996

Péter Csorba, József Osztényi

Publication date: 27 April 2010

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2009.12.024

zbMATH Keywords

multichromatic numbertopological lower bound

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)

Related Items

Extremal problems related to Betti numbers of flag complexes

Cites Work

• Unnamed Item
• Unnamed Item
• Kneser's conjecture, chromatic number, and homotopy
• Homotopy types of box complexes
• Graph colorings, spaces of edges and spaces of circuits
• n-tuple colorings and associated graphs
• Morse theory for cell complexes
• The multichromatic numbers of some Kneser graphs
• Topological lower bounds for the chromatic number: a hierarchy
• The chromatic number and other functions of the lexicographic product
• Complexes of graph homomorphisms
• On the Simple ℤ₂-homotopy Types of Graph Complexes and Their Simple ℤ₂-universality
• On graphs with strongly independent color-classes
• Using the Borsuk-Ulam theorem. Lectures on topological methods in combinatorics and geometry. Written in cooperation with Anders Björner and Günter M. Ziegler
• Combinatorial algebraic topology