One problem on geometric Ramsey numbers

DOI10.1007/s10958-014-2009-6zbMath1307.05161OpenAlexW1994707972MaRDI QIDQ2258893

Maria V. Titova

Publication date: 27 February 2015

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

Full work available at URL: https://doi.org/10.1007/s10958-014-2009-6

zbMATH Keywords

Ramsey distance number

Mathematics Subject Classification ID

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

Cites Work

• On large subgraphs with small chromatic numbers contained in distance graphs
• New bounds for the distance Ramsey number
• A new upper bound for diagonal Ramsey numbers
• Some unsolved problems
• On distance subgraphs of graphs in spaces of lower dimensions
• Distance Ramsey numbers
• On a series of Ramsey-type problems in combinatorial geometry
• Around Borsuk's hypothesis
• Excursions into combinatorial geometry
• Borsuk's problem and the chromatic numbers of some metric spaces
• Coloring Distance Graphs and Graphs of Diameters
• Research Problems in Discrete Geometry
• Graph Theory and Probability
• On the chromatic number of a space
• The realization of distances within sets in Euclidean space
• On Sets of Distances of n Points
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: One problem on geometric Ramsey numbers