On some non-rigid unit distance patterns
Fix a natural number \(k\). The paper determines the maximum number of \(k\)-paths in unit distance graphs with \(n\) vertices on the sphere of radius \(1/\sqrt{2}\) within a polylogarithmic factor; and gives bounds for the maximum number of \(k\)-cycles in unit distance graphs with \(n\) vertices on the sphere of radius \(1/\sqrt{2}\), which are similarly tight for \(k\geq 10\). They also show that for a given \(3\)-regular graph on \(k\) vertices, the number of copies of this graph in unit distance graphs with \(n\) vertices in \(\mathbb{R}^3\) is at most a polylog factor times \(n^{k/2}\). All these results are closely related to incidence problems between points and lines.
- Bounds on Point Configurations Determined by Distances and Dot Products
- Extremal problems in discrete geometry
- scientific article; zbMATH DE number 3153711 (Why is no real title available?)
- scientific article; zbMATH DE number 1054773 (Why is no real title available?)
- scientific article; zbMATH DE number 3893918 (Why is no real title available?)
- scientific article; zbMATH DE number 7760177 (Why is no real title available?)
- On dense bipartite graphs of girth eigth and upper bounds for certain configurations in planar point-line systems
- On Erdős chains in the plane
- On Sets of Distances of n Points
- On the number of discrete chains
- Research Problems in Discrete Geometry
- The number of congruent simplices in a point set
- Triangles in arrangements of points and lines in the plane
- Unit distances and diameters in Euclidean spaces
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)
