Author:
Erdős Paul,Fishburn Peter
Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference13 articles.
1. Distinct distances determined by subsets of a point set in space;Avis;Discrete Comput. Geom.,1991
2. Combinatorial complexity bounds for arrangements of curves and spheres;Clarkson;Discrete Comput. Geom.,1990
3. Unsolved Problems in Geometry;Croft,1991
4. Maximum number of different distance counts, manuscript;Csizmadia,1996
5. On sets of distances of n points;Erdős;Amer. Math. Monthly,1946
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. On a generalization of distance sets;Journal of Combinatorial Theory, Series A;2010-10
2. About convex 4-isosceles 7-point sets;Mathematical Notes;2009-06
3. On 5-isosceles sets in the plane, with linear restriction;Journal of Applied Mathematics and Computing;2008-06-18
4. A remarkable eight-point planar configuration;Discrete Mathematics;2002-05
5. Isosceles Planar Subsets;Discrete & Computational Geometry;1998-03