Uniqueness of maximum planar five-distance sets

DOI10.1016/j.disc.2007.08.028zbMath1144.05025OpenAlexW1979758769MaRDI QIDQ924997

Masashi Shinohara

Publication date: 29 May 2008

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2007.08.028

zbMATH Keywords

Euclidean planedistance sets

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10) Distance in graphs (05C12)

Related Items (11)

Classification of seven-point four-distance sets in the plane ⋮ Distance Sets on Circles ⋮ Sets in \(\mathbb{R}^d\) determining \(k\) taxicab distances ⋮ Maximal 2-distance sets containing the regular simplex ⋮ Complex spherical codes with two inner products ⋮ On a generalization of distance sets ⋮ Maximal \(m\)-distance sets containing the representation of the Hamming graph \(H(n, m)\) ⋮ Optimal point sets determining few distinct triangles ⋮ Characterizing optimal point sets determining one distinct triangle ⋮ A proof of a dodecahedron conjecture for distance sets ⋮ Lattice Configurations Determining Few Distances

Cites Work

• Unnamed Item
• Unnamed Item
• An upper bound for the cardinality of an s-distance subset in real Euclidean space. II
• Maximum planar sets that determine \(k\) distances
• Classification of three-distance sets in two dimensional Euclidean space
• Convex polygons with few intervertex distances
• Convex nonagons with five intervertex distances
• On A Problem of P. Erdos

This page was built for publication: Uniqueness of maximum planar five-distance sets