On distance graphs in rational spaces

DOI10.2140/moscow.2023.12.165zbMath1518.05139arXiv2301.06954OpenAlexW4379280408MaRDI QIDQ6098044

Artem A. Sokolov

Publication date: 9 June 2023

Published in: Moscow Journal of Combinatorics and Number Theory (Search for Journal in Brave)

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

zbMATH Keywords

quadratic formrational pointscliqueBeckman-Quarles theoremregular simplexEuclidean distance graph

Mathematics Subject Classification ID

Arrangements of points, flats, hyperplanes (aspects of discrete geometry) (52C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unit-distance graphs in rational n-spaces
• A discrete form of the Beckman-Quarles theorem for rational spaces
• The Beckman-Quarles theorem for rational spaces
• Embedding Euclidean distance graphs in \(\mathbb{R}^n\) and \(\mathbb{Q}^n\)
• Maximal dimension of unit simplices
• On Isometries of Euclidean Spaces
• On Single-Distance Graphs on the Rational Points in Euclidean Spaces

This page was built for publication: On distance graphs in rational spaces