On topological relaxations of chromatic conjectures

DOI10.1016/j.ejc.2010.06.001zbMath1221.05098arXiv1002.4536OpenAlexW1986758376WikidataQ123119847 ScholiaQ123119847MaRDI QIDQ710730

Ambrus Zsbán, Gábor Simonyi

Publication date: 22 October 2010

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1002.4536

zbMATH Keywords

chromatic number

Mathematics Subject Classification ID

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

Related Items

The Erdős–Faber–Lovász conjecture is true for n ≤ 12 ⋮ Square-free graphs are multiplicative ⋮ Shannon capacity and the categorical product ⋮ Hedetniemi's conjecture from the topological viewpoint ⋮ Altermatic number of categorical product of graphs ⋮ The fractional version of Hedetniemi's conjecture is true ⋮ Hedetniemi's conjecture for Kneser hypergraphs ⋮ The chromatic Ramsey number of odd wheels ⋮ On inverse powers of graphs and topological implications of Hedetniemi's conjecture ⋮ On a topological relaxation of a conjecture of Erdős and Nešetřil ⋮ Counterexamples to Hedetniemi's conjecture and infinite Boolean lattices

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Some remarks on Hajós' conjecture
• Kneser's conjecture, chromatic number, and homotopy
• Local chromatic number, Ky Fan's theorem, and circular colorings
• Homotopy types of box complexes
• Some remarks on the odd Hadwiger's conjecture
• Hom complexes and homotopy theory in the category of graphs
• The chromatic number of the product of two 4-chromatic graphs is 4
• Evenly distributed subsets of \(S^ n\) and a combinatorial application
• A fractional version of the Erdős-Faber-Lovász conjecture
• Hajos' graph-coloring conjecture: Variations and counterexamples
• The total coloring of a multigraph with maximal degree 4
• Hadwiger's conjecture for \(K_ 6\)-free graphs
• Fractionally colouring total graphs
• Fractional colouring and Hadwiger's conjecture
• Topology of Hom complexes and test graphs for bounding chromatic number
• Topological lower bounds for the chromatic number: a hierarchy
• Neighborhood complexes of stable Kneser graphs
• Box complexes, neighborhood complexes, and the chromatic number
• The fractional chromatic number of the categorical product of graphs
• Colorful subgraphs in Kneser-like graphs
• Fractional coloring and the odd Hadwiger's conjecture
• On the odd-minor variant of Hadwiger's conjecture
• On the total coloring of certain graphs
• Fractional chromatic numbers of cones over graphs
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• Local chromatic number and distinguishing the strength of topological obstructions
• On the Simple ℤ₂-homotopy Types of Graph Complexes and Their Simple ℤ₂-universality
• A Weakening of the Odd Hadwiger's Conjecture
• INTERSECTING FAMILIES OF SEPARATED SETS
• On graphs with strongly independent color-classes
• On Total Chromatic Number of a Graph
• 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