On large subgraphs with small chromatic numbers contained in distance graphs

DOI10.1007/s10958-016-2804-3zbMath1337.05042OpenAlexW2301099313MaRDI QIDQ289740

Andrei M. Raigorodskii, A. A. Kokotkin

Publication date: 31 May 2016

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

Full work available at URL: https://doi.org/10.1007/s10958-016-2804-3

zbMATH Keywords

distance graph on a plane

Mathematics Subject Classification ID

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

Related Items (1)

One problem on geometric Ramsey numbers

Cites Work

• A 15-colouring of 3-space omitting distance one
• On the space chromatic number
• The Erdős-Hadwiger problem and the chromatic numbers of finite geometric graphs
• Borsuk's problem and the chromatic numbers of some metric spaces
• Research Problems in Discrete Geometry
• The Mathematical Coloring Book
• On the chromatic number of a space
• The realization of distances within sets in Euclidean space
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On large subgraphs with small chromatic numbers contained in distance graphs