Uniqueness of maximum planar five-distance sets
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3815662 (Why is no real title available?)
- scientific article; zbMATH DE number 3234139 (Why is no real title available?)
- An upper bound for the cardinality of an s-distance subset in real Euclidean space. II
- Classification of three-distance sets in two dimensional Euclidean space
- Convex nonagons with five intervertex distances
- Convex polygons with few intervertex distances
- Maximum planar sets that determine \(k\) distances
- On A Problem of P. Erdos
Cited in
(17)- On a generalization of distance sets
- The 22 minimal dichotomy decompositions of the \(K_5\)-distance
- Distance Sets on Circles
- scientific article; zbMATH DE number 6107252 (Why is no real title available?)
- Maximal 2-distance sets containing the regular simplex
- Sparse distance sets in the triangular lattice
- Classification of seven-point four-distance sets in the plane
- Classification of three-distance sets in two dimensional Euclidean space
- A proof of a dodecahedron conjecture for distance sets
- Maximal \(m\)-distance sets containing the representation of the Hamming graph \(H(n, m)\)
- Lattice Configurations Determining Few Distances
- Distance sets with diameter graph being cycle
- Sets in \(\mathbb{R}^d\) determining \(k\) taxicab distances
- Characterizing optimal point sets determining one distinct triangle
- Complex spherical codes with two inner products
- scientific article; zbMATH DE number 4010627 (Why is no real title available?)
- Optimal point sets determining few distinct triangles
This page was built for publication: Uniqueness of maximum planar five-distance sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q924997)