Embedding Euclidean distance graphs in \(\mathbb{R}^n\) and \(\mathbb{Q}^n\)

DOI10.1007/S00010-022-00895-1zbMath1497.05062arXiv2108.07713OpenAlexW3195526373WikidataQ114232186 ScholiaQ114232186MaRDI QIDQ2172834

Matt Noble

Publication date: 16 September 2022

Published in: Aequationes Mathematicae (Search for Journal in Brave)

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

zbMATH Keywords

rational pointsgraph embeddinggraph dimensioneuclidean distance 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 (1)

On distance graphs in rational spaces

Cites Work

• Unnamed Item
• Unnamed Item
• On the Euclidean dimension of a complete multipartite graph
• The chromatic number of the plane is at least 5: a new proof
• Two notions of unit distance graphs
• The Mathematical Coloring Book
• Triangles with Vertices on Lattice Points
• The chromatic number of the plane is at least 5
• Computing Small Unit-Distance Graphs with Chromatic Number 5
• On the dimension of a graph
• Regular Simplices and Quadratic Forms
• On Single-Distance Graphs on the Rational Points in Euclidean Spaces

This page was built for publication: Embedding Euclidean distance graphs in \(\mathbb{R}^n\) and \(\mathbb{Q}^n\)