Chromatic numbers of Kneser-type graphs
From MaRDI portal
Publication:2299637
DOI10.1016/j.jcta.2019.105188zbMath1433.05131arXiv1811.10567OpenAlexW3001826208WikidataQ114162687 ScholiaQ114162687MaRDI QIDQ2299637
Publication date: 21 February 2020
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1811.10567
Coloring of graphs and hypergraphs (05C15) Distance in graphs (05C12) Graph designs and isomorphic decomposition (05C51)
Related Items (2)
Independence numbers of Johnson-type graphs ⋮ Bounds on Borsuk numbers in distance graphs of a special type
Cites Work
- Unnamed Item
- Unnamed Item
- Independence numbers and chromatic numbers of some distance graphs
- Random Kneser graphs and hypergraphs
- Kneser's conjecture, chromatic number, and homotopy
- On a packing and covering problem
- Forbidding just one intersection
- Intersection theorems with geometric consequences
- The junta method in extremal hypergraph theory and Chvátal's conjecture
- Coloring cross-intersecting families
- What we know and what we do not know about Turán numbers
- Chromatic numbers of some distance graphs
- Clique chromatic numbers of intersection graphs
- On the chromatic number of random subgraphs of a certain distance graph
- Coloring general Kneser graphs and hypergraphs via high-discrepancy hypergraphs
- Coloring some finite sets in {R}^{n}
- A counterexample to Borsuk’s conjecture
- Combinatorial Geometry and Coding Theory*
- On the chromatic numbers of small-dimensional Euclidean spaces
This page was built for publication: Chromatic numbers of Kneser-type graphs
