Chromatic numbers of some distance graphs
From MaRDI portal
Publication:2191956
DOI10.1134/S000143462001023XzbMath1462.05151arXiv1608.01873OpenAlexW3010434771MaRDI QIDQ2191956
Publication date: 26 June 2020
Published in: Mathematical Notes (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1608.01873
Coloring of graphs and hypergraphs (05C15) Graph representations (geometric and intersection representations, etc.) (05C62)
Related Items (2)
Bounds on Borsuk numbers in distance graphs of a special type ⋮ Chromatic numbers of Kneser-type graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Independence numbers and chromatic numbers of some distance graphs
- Independence numbers of random subgraphs of distance graphs
- On the stability of the Erdős-Ko-Rado theorem
- On the maximal number of edges in a uniform hypergraph with one forbidden intersection
- Theorems in the additive theory of numbers
- Intersection theorems with geometric consequences
- On the number of edges of a uniform hypergraph with a range of allowed intersections
- Improvements of the Frankl-Rödl theorem and geometric consequences
- On the number of edges in a uniform hypergraph with a range of permitted intersections
- The Difference Between Consecutive Primes, II
- Asymptotic study of the maximum number of edges in a uniform hypergraph with one forbidden intersection
- Coloring Distance Graphs and Graphs of Diameters
- Coloring some finite sets in {R}^{n}
- Independence numbers and chromatic numbers of the random subgraphs of some distance graphs
- Combinatorial Geometry and Coding Theory*
- On the chromatic numbers of small-dimensional Euclidean spaces
This page was built for publication: Chromatic numbers of some distance graphs
