On Some Non-Rigid Unit Distance Patterns
Nóra Frankl, Dora Woodruff

TL;DR
This paper explores geometric patterns with fixed distances on spheres and in 3D space, proving bounds on their maximum numbers.
Contribution
The paper provides sharp bounds for unit distance paths and cycles on specific spheres and examines 3-regular unit distance graphs in 3D.
Findings
Sharp bounds are proven for unit distance paths and cycles on spheres of radius 1/√2.
A related problem about 3-regular unit distance graphs in 3D space is analyzed.
Abstract
A recent generalization of the Erdős Unit Distance Problem, proposed by Palsson, Senger, and Sheffer, asks for the maximum number of unit distance paths with a given number of vertices in the plane and in 3-space. Studying a variant of this question, we prove sharp bounds on the number of unit distance paths and cycles on the sphere of radius \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}\end{document}1/2. We also consider a similar problem about 3-regular unit distance graphs in \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy}…
Genes, proteins, chemicals, diseases, species, mutations and cell lines named across the full text — each resolved to its canonical identifier and authoritative record.
Click any figure to enlarge with its caption.
Figure 1Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsLimits and Structures in Graph Theory · Computational Geometry and Mesh Generation · Advanced Graph Theory Research
