On a series of Ramsey-type problems in combinatorial geometry
From MaRDI portal
Publication:2518810
DOI10.1134/S1064562407020123zbMath1175.05139MaRDI QIDQ2518810
Publication date: 19 January 2009
Published in: Doklady Mathematics (Search for Journal in Brave)
05C12: Distance in graphs
05C55: Generalized Ramsey theory
52C10: Erd?s problems and related topics of discrete geometry
05D10: Ramsey theory
Related Items
New bounds for the distance Ramsey number, On distance subgraphs of graphs in spaces of lower dimensions, Tree components in random distance graphs of special form, Distance Ramsey numbers
Cites Work
- Unnamed Item
- A 15-colouring of 3-space omitting distance one
- On the space chromatic number
- Borsuk's problem and the chromatic numbers of some metric spaces
- Illuminating sets of constant width
- On the chromatic number of a space
- On a bound in Borsuk's problem
- Drei Sätze über die n-dimensionale euklidische Sphäre
- The connection between the Borsuk and Erdös-Hadwiger problems
- The realization of distances within sets in Euclidean space
- Spherical codes and Borsuk's conjecture