Sparse distance sets in the triangular lattice

zbMath1295.52011MaRDI QIDQ396964

Tanbir Ahmed, Hunter S. 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

zbMATH Keywords

triangular latticedistance sets

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\)

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