On a series of Ramsey-type problems in combinatorial geometry

DOI10.1134/S1064562407020123zbMath1175.05139OpenAlexW2082570780MaRDI QIDQ2518810

Andrei M. Raigorodskii

Publication date: 19 January 2009

Published in: Doklady Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s1064562407020123

zbMATH Keywords

distance graphdiameter graphRamsey type problemsRamsey diagonal number

Mathematics Subject Classification ID

Distance in graphs (05C12) Generalized Ramsey theory (05C55) Erd?s problems and related topics of discrete geometry (52C10) Ramsey theory (05D10)

Related Items (7)

Distance Ramsey numbers ⋮ Unnamed Item ⋮ New bounds for the distance Ramsey number ⋮ On threshold probabilities for the realization of a random graph by a geometric graph ⋮ On distance subgraphs of graphs in spaces of lower dimensions ⋮ Tree components in random distance graphs of special form ⋮ One problem on geometric 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

This page was built for publication: On a series of Ramsey-type problems in combinatorial geometry