On distance subgraphs of graphs in spaces of lower dimensions

DOI10.1007/s10958-012-1067-xzbMath1262.05043OpenAlexW1969854870MaRDI QIDQ1948589

Maria V. Titova, Andrei M. Raigorodskii

Publication date: 24 April 2013

Published in: Journal of Mathematical Sciences (New York) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10958-012-1067-x

zbMATH Keywords

induced subgraphsdistance graph

Mathematics Subject Classification ID

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

Related Items (2)

New bounds for the distance Ramsey number ⋮ One problem on geometric Ramsey numbers

Cites Work

• A new upper bound for diagonal Ramsey numbers
• A 15-colouring of 3-space omitting distance one
• On the space chromatic number
• On a series of Ramsey-type problems in combinatorial geometry
• Borsuk's problem and the chromatic numbers of some metric spaces
• The realization of distances within sets in Euclidean space
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On distance subgraphs of graphs in spaces of lower dimensions