Author:
Avis David,Erdös Paul,Pach János
Publisher
Springer Science and Business Media LLC
Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference13 articles.
1. Avis, D.: The number of furthest neighbour Pairs of a finite planar set. Amer. Math. Mon.91, 417–420 (1984)
2. Beck, J.: On the Lattice problem in the plane and some problems of Dirac, Motzkin, and Erdös in combinatorial geometry. Combinatorica3, 281–297 (1983)
3. Bollobás, B.: Extremal Graph Theory. London: Academic Press 1978
4. Chung, F.R.K., Szemerédi, E., Trotter W.T., Jr: Unpublished manuscript 1984
5. Erdös, P.: On sets of distances onn points in Euclidean space. Magyar Tud. Akad. Mat. Kutató Int. Kozl5, 165–169 (1960)
Cited by
13 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Favourite Distances in $3$-Space;The Electronic Journal of Combinatorics;2020-05-15
2. The Beginnings of Geometric Graph Theory;Bolyai Society Mathematical Studies;2013
3. Favorite Distances in High Dimensions;Thirty Essays on Geometric Graph Theory;2012-10-29
4. Large simplices determined by finite point sets;Beiträge zur Algebra und Geometrie / Contributions to Algebra and Geometry;2012-10-09
5. Bibliography;Combinatorial Geometry;2011-10-28