A generalization of Kneser's conjecture

DOI10.1016/j.disc.2011.08.013zbMath1245.05046arXiv0906.3427WikidataQ123166260 ScholiaQ123166260MaRDI QIDQ5891501

Hossein Hajiabolhassan

Publication date: 13 April 2012

Published in: Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

matching; graph colorings; graph of disjoint \(k\)-subsets of an \(n\)-set

Mathematics Subject Classification ID

05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)

05C15: Coloring of graphs and hypergraphs

Related Items

Local colourings of Cartesian product graphs, A note on local coloring of graphs, On the chromatic number of general Kneser hypergraphs, Colorful subhypergraphs in uniform hypergraphs, NP-completeness of local colorings of graphs, On the complexity of graph coloring with additional local conditions

Cites Work

• Kneser's conjecture, chromatic number, and homotopy
• Local chromatic number, Ky Fan's theorem, and circular colorings
• Circular coloring and Mycielski construction
• Local coloring of Kneser graphs
• Circular chromatic number of Kneser graphs
• A combinatorical proof of Kneser's conjecture
• Graph powers and graph homomorphisms
• A new coloring theorem of Kneser graphs
• Colorful subgraphs in Kneser-like graphs
• A constructive proof of Ky Fan's generalization of Tucker's lemma
• A generalization of Tucker's combinatorial lemma with topological applications
• Ein Satz über abelsche Gruppen mit Anwendungen auf die Geometrie der Zahlen
• A topological lower bound for the circular chromatic number of Schrijver graphs
• SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• 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
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item