A proof of Erdős-Fishburn's conjecture for \(g(6)=13\)
From MaRDI portal
Publication:1953348
zbMath1270.52022MaRDI QIDQ1953348
Publication date: 7 June 2013
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/v19i4p38
Related Items (9)
Distance Sets on Circles ⋮ Sparse distance sets in the triangular lattice ⋮ Sets in \(\mathbb{R}^d\) determining \(k\) taxicab distances ⋮ Maximal 2-distance sets containing the regular simplex ⋮ Unnamed Item ⋮ Maximal \(m\)-distance sets containing the representation of the Hamming graph \(H(n, m)\) ⋮ Optimal point sets determining few distinct triangles ⋮ A proof of a dodecahedron conjecture for distance sets ⋮ Lattice Configurations Determining Few Distances
This page was built for publication: A proof of Erdős-Fishburn's conjecture for \(g(6)=13\)
