New bounds for the distance Ramsey number

DOI10.1016/j.disc.2013.07.022zbMath1281.05094arXiv1307.0843OpenAlexW2963932926MaRDI QIDQ393923

Maria V. Titova, Andrey B. Kupavskii, Andrei M. Raigorodskii

Publication date: 24 January 2014

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

Full work available at URL: https://arxiv.org/abs/1307.0843

zbMATH Keywords

Ramsey numberdistance graphdistance Ramsey number

Mathematics Subject Classification ID

Distance in graphs (05C12) Generalized Ramsey theory (05C55) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (8)

Unnamed Item ⋮ On threshold probabilities for the realization of a random graph by a geometric graph ⋮ Realization of subgraphs of random graphs by graphs of diameters in Euclidean spaces ⋮ Two notions of unit distance graphs ⋮ One problem on geometric Ramsey numbers ⋮ Embedding graphs in Euclidean space ⋮ Embedding graphs in Euclidean space ⋮ On the realization of subgraphs of a random graph by diameter graphs in Euclidean spaces

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A new upper bound for diagonal Ramsey numbers
• On a packing and covering problem
• On distance subgraphs of graphs in spaces of lower dimensions
• On extremal problems of graphs and generalized graphs
• On a series of Ramsey-type problems in combinatorial geometry
• Around Borsuk's hypothesis
• Borsuk's problem and the chromatic numbers of some metric spaces
• Research Problems in Discrete Geometry
• On Sets of Distances of n Points

This page was built for publication: New bounds for the distance Ramsey number