Obstructions to the realization of distance graphs with large chromatic numbers on spheres of small radii
Journal Article
·
· Sbornik. Mathematics
- M. V. Lomonosov Moscow State University, Faculty of Mechanics and Mathematics, Moscow (Russian Federation)
We investigate in detail some properties of distance graphs constructed on the integer lattice. Such graphs find wide applications in problems of combinatorial geometry, in particular, such graphs were employed to answer Borsuk's question in the negative and to obtain exponential estimates for the chromatic number of the space. This work is devoted to the study of the number of cliques and the chromatic number of such graphs under certain conditions. Constructions of sequences of distance graphs are given, in which the graphs have unit length edges and contain a large number of triangles that lie on a sphere of radius 1/√3 (which is the minimum possible). At the same time, the chromatic numbers of the graphs depend exponentially on their dimension. The results of this work strengthen and generalize some of the results obtained in a series of papers devoted to related issues. Bibliography: 29 titles.
- OSTI ID:
- 22365952
- Journal Information:
- Sbornik. Mathematics, Journal Name: Sbornik. Mathematics Journal Issue: 10 Vol. 204; ISSN 1064-5616
- Country of Publication:
- United States
- Language:
- English
Similar Records
Distance graphs having large chromatic numbers and containing no cliques or cycles of a given size
Chromatic numbers of real and rational spaces with real or rational forbidden distances
On the Ramsey numbers for complete distance graphs with vertices in {l_brace}0,1{r_brace}{sup n}
Journal Article
·
Tue Apr 30 00:00:00 EDT 2013
· Sbornik. Mathematics
·
OSTI ID:22167843
Chromatic numbers of real and rational spaces with real or rational forbidden distances
Journal Article
·
Wed Apr 30 00:00:00 EDT 2008
· Sbornik. Mathematics
·
OSTI ID:21096796
On the Ramsey numbers for complete distance graphs with vertices in {l_brace}0,1{r_brace}{sup n}
Journal Article
·
Wed Dec 30 23:00:00 EST 2009
· Sbornik. Mathematics
·
OSTI ID:21301247