Local chromatic number, Ky Fan's theorem, and circular colorings

From MaRDI portal
Revision as of 16:48, 30 January 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:879165


DOI10.1007/s00493-006-0034-xzbMath1121.05050arXivmath/0407075MaRDI QIDQ879165

Gábor Simonyi, Gábor Tardos

Publication date: 8 May 2007

Published in: Combinatorica (Search for Journal in Brave)

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


05C15: Coloring of graphs and hypergraphs

55U10: Simplicial sets and complexes in algebraic topology


Related Items

On the Multichromatic Number of s‐Stable Kneser Graphs, A generalization of Kneser's conjecture, Dynamic coloring of graphs having no \(K_5\) minor, A combinatorial proof for the circular chromatic number of Kneser graphs, Generalised Mycielski graphs, signature systems, and bounds on chromatic numbers, Colorful subhypergraphs in Kneser hypergraphs, Clawfreeness of the powers of a graph, On the chromatic number of general Kneser hypergraphs, \((n,m)\)-fold covers of spheres, Hedetniemi's conjecture for Kneser hypergraphs, On topological relaxations of chromatic conjectures, Non-cover generalized Mycielski, Kneser, and Schrijver graphs, Homotopy types of box complexes of chordal graphs, Circular coloring and Mycielski construction, Symmetries of the stable Kneser graphs, Combinatorial Stokes formulas via minimal resolutions, On colorings of graph powers, A generalization of the Erdős-Ko-Rado theorem, Topology of Hom complexes and test graphs for bounding chromatic number, Oriented matroids and Ky Fan's theorem, The chromatic discrepancy of graphs, Colouring quadrangulations of projective spaces, On the adaptable chromatic number of graphs, A new coloring theorem of Kneser graphs, Local chromatic number of quadrangulations of surfaces, Colorful subgraphs in Kneser-like graphs, Local chromatic number and Sperner capacity, On directed local chromatic number, shift graphs, and Borsuk-like graphs, NP for Combinatorialists, Local chromatic number and distinguishing the strength of topological obstructions