DOIAbstract
AbstractMaximum planar sets that determine k distances are identified for k ⩽ 5. Evidence is presented for the conjecture that all maximum sets for k ⩾ 7 are subsets of the triangular lattice
AbstractMaximum planar sets that determine k distances are identified for k ⩽ 5. Evidence is presented for the conjecture that all maximum sets for k ⩾ 7 are subsets of the triangular lattice
AbstractThe distance d(f,f′) between two triangular embeddings f and f′ of a complete graph is the m...
AbstractWe determine all homogenous linear inequalities satisfied by the numbers of occurrences of t...
AbstractFor each n ⩾ 3 let Fn denote the set of all integer vectors f = (f1, f2, …, fn) with 1 ⩽ f1 ...
AbstractMaximum planar sets that determine k distances are identified for k ⩽ 5. Evidence is present...
AbstractLet nk denote the number of times the kth largest distance occurs among a set S of n points ...
International audienceA lattice (d, k)-polytope is the convex hull of a set of points in dimension d...
AbstractLet g(k) be the smallest integer n for which there are n planar points each of which has k o...
AbstractLet 1 = d1 < d2 < ⋯ < dk denote the distinct distances determined by a set of n points in th...
We prove that a well-distributed subset of R 2 can have a distance set ∆ with #( ∆ ∩ [0, N]) ≤ CN ...
A planar point set X is called a k-distance set if there are exactly k distinct distances defined b...
We answer the following question posed by Paul Erd&quot;os and George Purdy: determine the large...
A finite set of vectors X in the d-dimensional Euclidean space Rd is called an s-distance set if the...
AbstractA subset X in k-dimensional Euclidean space Rk is called an s-distance set if there are exac...
AbstractLet fk(Δ) be the maximum number of vertices in a planar graph with diameter k and maximum de...
We show the following two results on a set of n points in the plane, thus answering questions posed ...
AbstractThe distance d(f,f′) between two triangular embeddings f and f′ of a complete graph is the m...
AbstractWe determine all homogenous linear inequalities satisfied by the numbers of occurrences of t...
AbstractFor each n ⩾ 3 let Fn denote the set of all integer vectors f = (f1, f2, …, fn) with 1 ⩽ f1 ...
AbstractMaximum planar sets that determine k distances are identified for k ⩽ 5. Evidence is present...
AbstractLet nk denote the number of times the kth largest distance occurs among a set S of n points ...
International audienceA lattice (d, k)-polytope is the convex hull of a set of points in dimension d...
AbstractLet g(k) be the smallest integer n for which there are n planar points each of which has k o...
AbstractLet 1 = d1 < d2 < ⋯ < dk denote the distinct distances determined by a set of n points in th...
We prove that a well-distributed subset of R 2 can have a distance set ∆ with #( ∆ ∩ [0, N]) ≤ CN ...
A planar point set X is called a k-distance set if there are exactly k distinct distances defined b...
We answer the following question posed by Paul Erd&quot;os and George Purdy: determine the large...
A finite set of vectors X in the d-dimensional Euclidean space Rd is called an s-distance set if the...
AbstractA subset X in k-dimensional Euclidean space Rk is called an s-distance set if there are exac...
AbstractLet fk(Δ) be the maximum number of vertices in a planar graph with diameter k and maximum de...
We show the following two results on a set of n points in the plane, thus answering questions posed ...
AbstractThe distance d(f,f′) between two triangular embeddings f and f′ of a complete graph is the m...
AbstractWe determine all homogenous linear inequalities satisfied by the numbers of occurrences of t...
AbstractFor each n ⩾ 3 let Fn denote the set of all integer vectors f = (f1, f2, …, fn) with 1 ⩽ f1 ...
Add to ORKG