Sparse distance sets in the triangular lattice

zbMATH Open1295.52011MaRDI QIDQ396964FDOQ396964

Authors: Tanbir Ahmed, Hunter Snevily 

Publication date: 14 August 2014

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: http://www.combinatorics.org/ojs/index.php/eljc/article/view/v20i4p33

Recommendations

• Maximum planar sets that determine \(k\) distances
• A proof of Erdős-Fishburn's conjecture for \(g(6)=13\)
• On distance sets in the triangular lattice
• Uniqueness of maximum planar five-distance sets
• Two and a half billion years of distance research

zbMATH Keywords

distance setstriangular lattice

Mathematics Subject Classification ID

Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Erd?s problems and related topics of discrete geometry (52C10)

Cites Work

• Maximum planar sets that determine \(k\) distances
• A proof of Erdős-Fishburn's conjecture for \(g(6)=13\)

Cited In (2)

• On distance sets in the triangular lattice
• On Optimal Point Sets Determining Distinct Triangles

This page was built for publication: Sparse distance sets in the triangular lattice

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