On the Chromatic Number of Matching Kneser Graphs
From MaRDI portal
Publication:5222567
DOI10.1017/S0963548319000178zbMath1439.05076arXiv1507.08456OpenAlexW2972707657WikidataQ127243333 ScholiaQ127243333MaRDI QIDQ5222567
Meysam Alishahi, Hajiabolhassan Hossein
Publication date: 6 April 2020
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1507.08456
Related Items (2)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Structure of independent sets in direct products of some vertex-transitive graphs
- On the chromatic number of general Kneser hypergraphs
- Kneser's conjecture, chromatic number, and homotopy
- An Erdős--Ko--Rado theorem for partial permutations
- Local chromatic number, Ky Fan's theorem, and circular colorings
- Hamiltonian degree sequences in digraphs
- A new proof of the Erdős-Ko-Rado theorem for intersecting families of permutations
- Tiling Turán theorems
- Generalized Kneser coloring theorems with combinatorial proofs
- A short proof for Chen's alternative Kneser coloring lemma
- Box complexes, neighborhood complexes, and the chromatic number
- Colourful theorems and indices of homomorphism complexes
- Chromatic number via Turán number
- The minimum degree threshold for perfect graph packings
- On chromatic number and minimum cut
- A new coloring theorem of Kneser graphs
- Ein Satz über abelsche Gruppen mit Anwendungen auf die Geometrie der Zahlen
- Bipartite Graph Tiling
- The Chromatic Number of Kneser Hypergraphs
- Embedding Spanning Bipartite Graphs of Small Bandwidth
- The Factorization of Linear Graphs
- Intersecting families of permutations
- 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
- Proof of the Alon-Yuster conjecture
This page was built for publication: On the Chromatic Number of Matching Kneser Graphs
