Strengthening topological colorful results for graphs
From MaRDI portal
Publication:2359976
DOI10.1016/j.ejc.2017.03.011zbMath1365.05081arXiv1606.02544OpenAlexW2411195307MaRDI QIDQ2359976
Hossein Hajiabolhassan, Meysam Alishahi, Frédéric Meunier
Publication date: 23 June 2017
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1606.02544
Related Items
Chromatic number of random Kneser hypergraphs, Colorings of complements of line graphs, 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, Topological Bounds for Graph Representations over Any Field, Colorful subhypergraphs in uniform hypergraphs, Multilabeled Versions of Sperner's and Fan's Lemmas and Applications, The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A combinatorial proof for the circular chromatic number of Kneser graphs
- Colorful subhypergraphs in Kneser hypergraphs
- On the chromatic number of general Kneser hypergraphs
- Hedetniemi's conjecture for Kneser hypergraphs
- Kneser's conjecture, chromatic number, and homotopy
- Local chromatic number, Ky Fan's theorem, and circular colorings
- On the b-chromatic number of Kneser graphs
- A certain combinatorial inequality
- Graphs whose circular chromatic number equals the chromatic number
- n-tuple colorings and associated graphs
- A survey on Hedetniemi's conjecture
- Circular chromatic number of Kneser graphs
- A short proof for Chen's alternative Kneser coloring lemma
- Topological lower bounds for the chromatic number: a hierarchy
- Colourful theorems and indices of homomorphism complexes
- Graph powers and graph homomorphisms
- A new coloring theorem of Kneser graphs
- A course in topological combinatorics
- Colorful subgraphs in Kneser-like graphs
- The Borsuk--Ulam-property, Tucker-property and constructive proofs in combinatorics
- On the cancellation law among finite relational structures
- On the diameter of Kneser graphs
- A generalization of Tucker's combinatorial lemma with topological applications
- Ein Satz über abelsche Gruppen mit Anwendungen auf die Geometrie der Zahlen
- Star chromatic numbers and products of graphs
- Multichromatic numbers, star chromatic numbers and Kneser graphs
- Acyclic graph coloring and the complexity of the star chromatic number
- A topological lower bound for the circular chromatic number of Schrijver graphs
- Operations with structures
- 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
