Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference12 articles.
1. A Turán-type extremal theory of convex geometric graphs;Brass,2003
2. The maximum number of times the same distance can occur among the vertices of a convex n-gon is O(nlogn);Brass;J. Combin. Theory Ser. A,2001
3. A lower bound on the number of unit distances between the vertices of a convex polygon;Edelsbrunner;J. Combin. Theory Ser. A,1991
4. On sets of distances of n points;Erdős;Amer. Math. Monthly,1946
5. Problem 11;Erdős;Canad. Math. Bull.,1959
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献