A new coloring theorem of Kneser graphs
From MaRDI portal
Publication:2431265
DOI10.1016/J.JCTA.2010.08.008zbMATH Open1227.05142OpenAlexW1990568682MaRDI QIDQ2431265FDOQ2431265
Authors: Peng-An Chen 
Publication date: 11 April 2011
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jcta.2010.08.008
Recommendations
- On \(b\)-coloring of the Kneser graphs
- \(b\)-coloring of Kneser graphs
- A note on \(b\)-coloring of Kneser graphs
- On total and edge coloring some Kneser graphs
- On generalized Kneser hypergraph colorings
- Generalized Kneser coloring theorems with combinatorial proofs
- The multichromatic numbers of some Kneser graphs
- A new kind of graph coloring
- A new proof of the colored Kruskal-Katona theorem
- Kneser colorings of uniform hypergraphs
chromatic numbercircular chromatic numberKneser graphsmatching admissible sequencesoctahedral Fan's Lemma
Cites Work
- Kneser's conjecture, chromatic number, and homotopy
- Title not available (Why is that?)
- Local chromatic number, Ky Fan's theorem, and circular colorings
- Circular chromatic number of Kneser graphs
- Generalized Kneser coloring theorems with combinatorial proofs
- A combinatorical proof of Kneser's conjecture
- A generalization of Tucker's combinatorial lemma with topological applications
- Circular chromatic numbers of some reduced Kneser graphs
- Multichromatic numbers, star chromatic numbers and Kneser graphs
- A topological lower bound for the circular chromatic number of Schrijver graphs
- A certain combinatorial inequality
- Title not available (Why is that?)
- Combinatorial Stokes formulae
- Simplicial maps from an orientable n-pseudomanifold into Sm with the octahedral triangulation
Cited In (25)
- On the multichromatic number of \(s\)-stable Kneser graphs
- Coloring properties of categorical product of general Kneser hypergraphs
- A note on \(b\)-coloring of Kneser graphs
- A special case of the stahl conjecture
- On the chromatic number of general Kneser hypergraphs
- Strengthening topological colorful results for graphs
- A topological proof of Chen's alternative Kneser coloring theorem
- Coloring graphs by translates in the circle
- A combinatorial proof for the circular chromatic number of Kneser graphs
- On the chromatic number of a subgraph of the Kneser graph
- On the chromatic number of matching Kneser graphs
- Coloring general Kneser graphs and hypergraphs via high-discrepancy hypergraphs
- A generalization of Kneser's conjecture
- Colorful subgraphs in Kneser-like graphs
- Almost all k-colorable graphs are easy to color
- Circular chromatic number of Kneser graphs
- Häggkvist-Hell graphs: A class of Kneser-colorable graphs
- A new lower bound for the chromatic number of general Kneser hypergraphs
- Circular chromatic number of induced subgraphs of Kneser graphs
- A short proof for Chen's alternative Kneser coloring lemma
- Circular colouring and algebraic no-homomorphism theorems
- Colorful subhypergraphs in uniform hypergraphs
- Colorings of complements of line graphs
- Kőnig's edge-colouring theorem for all graphs
- Proof of a conjecture on edge coloring of the Kneser graph K(t,2)
This page was built for publication: A new coloring theorem of Kneser graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2431265)
