Turán-type bounds for distance graphs
From MaRDI portal
Publication:2411797
DOI10.1134/S1064562417040135zbMath1373.05055OpenAlexW2751516359MaRDI QIDQ2411797
Andrei M. Raigorodskii, Lev E. Shabanov
Publication date: 25 October 2017
Published in: Doklady Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1134/s1064562417040135
Related Items (4)
Estimate of the number of edges in special subgraphs of a distance graph ⋮ Distance graphs with large chromatic number and without cliques of given size in the rational space ⋮ Refinement of lower bounds of the chromatic number of a space with forbidden one-color triangles ⋮ The number of edges in induced subgraphs of some distance graphs
Cites Work
- Unnamed Item
- On the measurable chromatic number of a space of dimension \(n \leq 24\)
- Estimate for the chromatic number of Euclidean space with several forbidden distances
- A new estimate for the number of edges in induced subgraphs of a special distance graph
- Turán type results for distance graphs
- Independence, clique size and maximum degree
- On Schur's conjecture in \(\mathbb R^4\)
- New lower bound for the chromatic number of a rational space with one and two forbidden distances
- The Mathematical Coloring Book
- Lower bounds on size and independence inK4-free graphs
- On Sets of Distances of n Points
This page was built for publication: Turán-type bounds for distance graphs
