Local chromatic number and distinguishing the strength of topological obstructions
From MaRDI portal
Publication:3605849
DOI10.1090/S0002-9947-08-04643-6zbMath1170.05027arXivmath/0502452OpenAlexW1973273044MaRDI QIDQ3605849
Gábor Tardos, Gábor Simonyi, Siniša T. Vrećica
Publication date: 25 February 2009
Published in: Transactions of the American Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0502452
Relations of low-dimensional topology with graph theory (57M15) Coloring of graphs and hypergraphs (05C15)
Related Items (11)
Dynamic coloring of graphs having no \(K_5\) minor ⋮ Unnamed Item ⋮ Generalised Mycielski graphs, signature systems, and bounds on chromatic numbers ⋮ Local orthogonality dimension ⋮ Altermatic number of categorical product of graphs ⋮ Homomorphism complexes, reconfiguration, and homotopy for directed graphs ⋮ Local chromatic number of quadrangulations of surfaces ⋮ On topological relaxations of chromatic conjectures ⋮ On directed local chromatic number, shift graphs, and Borsuk-like graphs ⋮ A generalization of the Erdős-Ko-Rado theorem ⋮ On inverse powers of graphs and topological implications of Hedetniemi's conjecture
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Bier spheres and barycentric subdivision
- Kneser's conjecture, chromatic number, and homotopy
- Local chromatic number, Ky Fan's theorem, and circular colorings
- Homotopy types of box complexes
- Coloring graphs with locally few colors
- Evenly distributed subsets of \(S^ n\) and a combinatorial application
- A short proof of Kneser's conjecture
- Topological lower bounds for the chromatic number: a hierarchy
- From graphs to ortholattices and equivariant maps
- Coloring locally bipartite graphs on surfaces.
- Neighborhood complexes of stable Kneser graphs
- Complexes of graph homomorphisms
- Local chromatic number of quadrangulations of surfaces
- Colorful subgraphs in Kneser-like graphs
- Local chromatic number and Sperner capacity
- WI-posets, graph complexes and \(\mathbb{Z}_2\)-equivalences
- A generalization of Tucker's combinatorial lemma with topological applications
- Chromatic numbers of quadrangulations on closed surfaces
- Fractional chromatic numbers of cones over graphs
- Graph Theory and Probability
- The Chromatic Number of Kneser Hypergraphs
- Equivariant Cohomology and Lower Bounds for Chromatic Numbers
- Coincidence and The Colouring of Maps
- On graphs with strongly independent color-classes
- Antipodal Coincidence for Maps of Spheres into Complexes
- 4-chromatic projective graphs
- Equivalent Formulations of the Borsuk-Ulam Theorem
- 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
This page was built for publication: Local chromatic number and distinguishing the strength of topological obstructions
