Colorful subgraphs in Kneser-like graphs
From MaRDI portal
Publication:2461775
DOI10.1016/j.ejc.2007.04.015zbMath1125.05042arXivmath/0512019OpenAlexW2083711510MaRDI QIDQ2461775
Publication date: 21 November 2007
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0512019
Related Items
Strengthening topological colorful results for graphs ⋮ Dynamic coloring of graphs having no \(K_5\) minor ⋮ Colorful subhypergraphs in Kneser hypergraphs ⋮ Local orthogonality dimension ⋮ On the number of star‐shaped classes in optimal colorings of Kneser graphs ⋮ Coloring properties of categorical product of general Kneser hypergraphs ⋮ Circular chromatic number of induced subgraphs of Kneser graphs ⋮ A generalization of Kneser's conjecture ⋮ On the chromatic number of general Kneser hypergraphs ⋮ Colorful subhypergraphs in uniform hypergraphs ⋮ A new lower bound for the chromatic number of general Kneser hypergraphs ⋮ Hedetniemi's conjecture for Kneser hypergraphs ⋮ A new class of transitive graphs ⋮ On topological relaxations of chromatic conjectures ⋮ Local chromatic number and distinguishing the strength of topological obstructions ⋮ Combinatorial Stokes formulas via minimal resolutions ⋮ On colorings of graph powers ⋮ Colouring quadrangulations of projective spaces
Cites Work
- 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
- Circular chromatic number and a generalization of the construction of Mycielski.
- Topological lower bounds for the chromatic number: a hierarchy
- Box complexes, neighborhood complexes, and the chromatic number
- WI-posets, graph complexes and \(\mathbb{Z}_2\)-equivalences
- A generalization of Tucker's combinatorial lemma with topological applications
- Fractional chromatic numbers of cones over graphs
- The Chromatic Number of Kneser Hypergraphs
- TRANSVERSALS OF FAMILIES OF SETS IN $ \mathbb{R}^n$ AND A CONNECTION BETWEEN THE HELLY AND BORSUK THEOREMS
- A New Short Proof of Kneser's Conjecture
- On graphs with strongly independent color-classes
- A topological lower bound for the circular chromatic number of Schrijver graphs
- Equivalent Formulations of the Borsuk-Ulam Theorem
- Sur le coloriage des graphs
- 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
- Circular chromatic number: A survey
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
