On some non-rigid unit distance patterns

DOI10.1007/S00454-023-00503-2MaRDI QIDQ6624178FDOQ6624178

Authors: Nóra Frankl, Dora Woodruff 

Publication date: 25 October 2024

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Recommendations

• scientific article; zbMATH DE number 2145248
• Unit distances
• Erdős’s Unit Distance Problem
• On the approximate unit distance problem
• A characterization in \(\mathbb{Z}^ n\) of finite unit-distance graphs in \(\mathbb{R}^ n\)

zbMATH Keywords

geometric incidencesdiscrete chainsErdős unit-distance problem

Mathematics Subject Classification ID

Distance in graphs (05C12) Erd?s problems and related topics of discrete geometry (52C10)

Cites Work

• Research Problems in Discrete Geometry
• On Sets of Distances of n Points
• Extremal problems in discrete geometry
• Unit distances and diameters in Euclidean spaces
• Title not available (Why is that?)
• The number of congruent simplices in a point set
• On dense bipartite graphs of girth eigth and upper bounds for certain configurations in planar point-line systems
• Title not available (Why is that?)
• Title not available (Why is that?)
• Triangles in arrangements of points and lines in the plane
• On the number of discrete chains
• Title not available (Why is that?)
• Bounds on Point Configurations Determined by Distances and Dot Products
• On Erdős chains in the plane

This page was built for publication: On some non-rigid unit distance patterns

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6624178)