On the Ramsey numbers for complete distance graphs with vertices in {l_brace}0,1{r_brace}{sup n}
Journal Article
·
· Sbornik. Mathematics
- M. V. Lomonosov Moscow State University, Faculty of Mechanics and Mathematics, Moscow (Russian Federation)
A new problem of Ramsey type is posed for complete distance graphs in R{sup n} with vertices in the Boolean cube. This problem is closely related to the classical Nelson-Erdos-Hadwiger problem on the chromatic number of a space. Several quite sharp estimates are obtained for certain numerical characteristics that appear in the framework of the problem. Bibliography: 15 titles.
- OSTI ID:
- 21301247
- Journal Information:
- Sbornik. Mathematics, Journal Name: Sbornik. Mathematics Journal Issue: 12 Vol. 200; ISSN 1064-5616
- Country of Publication:
- United States
- Language:
- English
Similar Records
Chromatic numbers of real and rational spaces with real or rational forbidden distances
Obstructions to the realization of distance graphs with large chromatic numbers on spheres of small radii
Covering sets in R{sup m}
Journal Article
·
Wed Apr 30 00:00:00 EDT 2008
· Sbornik. Mathematics
·
OSTI ID:21096796
Obstructions to the realization of distance graphs with large chromatic numbers on spheres of small radii
Journal Article
·
Thu Oct 31 00:00:00 EDT 2013
· Sbornik. Mathematics
·
OSTI ID:22365952
Covering sets in R{sup m}
Journal Article
·
Sun Aug 31 00:00:00 EDT 2014
· Sbornik. Mathematics
·
OSTI ID:22364913