A proof of a dodecahedron conjecture for distance sets

DOI10.1007/s00373-021-02318-5zbMath1486.52049arXiv2009.13111OpenAlexW3155673956WikidataQ113905212 ScholiaQ113905212MaRDI QIDQ2051877

Masashi Shinohara, Hiroshi Nozaki

Publication date: 25 November 2021

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2009.13111

zbMATH Keywords

distance setsdodecahedron

Mathematics Subject Classification ID

Erd?s problems and related topics of discrete geometry (52C10) General theory of distance geometry (51K05)

Uses Software

• Magma
• Maple

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Distance-regular graphs
• A simpler proof for the two disjoint odd cycles theorem
• Uniqueness of maximum planar five-distance sets
• An upper bound for the cardinality of an s-distance subset in real Euclidean space. II
• Maximum planar sets that determine \(k\) distances
• How many P-polynomial structures can an association scheme have?
• Unsolved problems in geometry
• New maximal two-distance sets
• The Magma algebra system. I: The user language
• Some properties of graphs of diameters
• Classification of three-distance sets in two dimensional Euclidean space
• A proof of Erdős-Fishburn's conjecture for \(g(6)=13\)
• Constructions of maximum few-distance sets in Euclidean spaces
• On Two-Distance Sets in Euclidean Space
• The width of quadrangulations of the projective plane
• Group Theory in Physics
• Complementary Ramsey Numbers

This page was built for publication: A proof of a dodecahedron conjecture for distance sets