On the chromatic numbers of some distance graphs
From MaRDI portal
Publication:1709876
DOI10.1134/S1064562418060297zbMath1403.05052OpenAlexW2899886324MaRDI QIDQ1709876
T. V. Trukhan, Andrei M. Raigorodskii
Publication date: 15 January 2019
Published in: Doklady Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1134/s1064562418060297
Related Items (5)
Estimate of the number of edges in special subgraphs of a distance graph ⋮ A generalization of Kneser graphs ⋮ On the independence number and the chromatic number of generalized preferential attachment models ⋮ Bounds on Borsuk numbers in distance graphs of a special type ⋮ On the chromatic number of random subgraphs of a certain distance graph
Cites Work
- An improvement of the Frankl-Wilson theorem on the number of edges in a hypergraph with forbidden intersections of edges
- On a bound in extremal combinatorics
- Erdős-Ko-Rado theorem for \(\{0,\pm 1\}\)-vectors
- Regular bipartite graphs and intersecting families
- Coloring cross-intersecting families
- New upper bounds for the independence numbers of graphs with vertices in \(\{-1,0,1\}^n\) and their applications to problems of the chromatic numbers of distance graphs
- On the chromatic numbers of low-dimensional spaces
- 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 Erdős-Hadwiger problem and the chromatic numbers of finite geometric graphs
- Asymptotic study of the maximum number of edges in a uniform hypergraph with one forbidden intersection
- On the chromatic number of a space
- Combinatorial Geometry and Coding Theory*
- The Erdõs-Hadwiger problem and the chromatic numbers of finite geometric graphs
- On the chromatic numbers of small-dimensional Euclidean spaces
This page was built for publication: On the chromatic numbers of some distance graphs
