A new coloring theorem of Kneser graphs

DOI10.1016/J.JCTA.2010.08.008MaRDI QIDQ2431265zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

chromatic numbercircular chromatic numberKneser graphsmatching admissible sequencesoctahedral Fan's Lemma

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

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

Cites work

• scientific article; zbMATH DE number 3672329 (Why is no real title available?)
• scientific article; zbMATH DE number 3102257 (Why is no real title available?)
• A certain combinatorial inequality
• A combinatorical proof of Kneser's conjecture
• A generalization of Tucker's combinatorial lemma with topological applications
• A topological lower bound for the circular chromatic number of Schrijver graphs
• Circular chromatic number of Kneser graphs
• Circular chromatic numbers of some reduced Kneser graphs
• Combinatorial Stokes formulae
• Generalized Kneser coloring theorems with combinatorial proofs
• Kneser's conjecture, chromatic number, and homotopy
• Local chromatic number, Ky Fan's theorem, and circular colorings
• Multichromatic numbers, star chromatic numbers and Kneser graphs
• Simplicial maps from an orientable n-pseudomanifold into Sm with the octahedral triangulation

Cited in

(25)

• Proof of a conjecture on edge coloring of the Kneser graph K(t,2)
• 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
• A short proof for Chen's alternative Kneser coloring lemma
• Circular chromatic number of induced subgraphs of Kneser graphs
• 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

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)