Research problems

1. J. Beck, The lattice property of the plane and some problems of Dirac, Motzkin and Erdős in combinatorial geometry.Combinatorica 3 (1983), 281–297.

   Article  MathSciNet  MATH  Google Scholar 

2. J. Beck andJ. Spencer, Unit distances,J. Combin. Theory Ser. A. (To appear)

3. S. A. Burr, B. Grünbaum andN. J. A. Sloane, The orchard problem,Geometriae Dedicata 2 (1974), 397–427.MR 49 # 2428

   Article  MathSciNet  MATH  Google Scholar 

4. P. Erdős, On a problem of Grünbaum,Canad. Math. Bull. 15 (1972), 23–25.MR 47 # 5709

   Article  MathSciNet  MATH  Google Scholar 

5. Z. Füredi andI. Palásti, Arrangement of lines with large number of triangles,Proc. Amer. Math. Soc. (To appear)

6. B. Grünbaum, New views on some old questions of combinatorial geometry,Colloquio Internazionale sulle Teorie Combinatorie (Proc. Colloq., Rome, 1973), I, Accad. Naz. Lincei, Roma, 1976; 451–468.MR 57 # 10605

   Google Scholar 

7. B. Grünbaum,Arrangements and spreads, Amer. Math. Soc., Providence, R. I., 1972.MR 46 # 6148

   Book  MATH  Google Scholar 

8. L. M. Kelly andW. O. J. Moser, On the number of ordinary lines determined byn points,Canad. J. Math. 1 (1958), 210–219.MR 20 # 3494

   Article  MathSciNet  MATH  Google Scholar 

9. W. O. J. Moser,Problems in discrete geometry. (Mimeographed noted, come out yearly)

10. T. S. Motzkin, The lines and planes connecting the points of a finite set,Trans. Amer. Math. Soc. 70 (1951), 451–464.MR 12–849

    Article  MathSciNet  MATH  Google Scholar 

11. E. Szemerédi andW. T. Trotter, Extremal problems in discrete geometry,Combinatorica 3 (1983), 381–392.

    Article  MathSciNet  MATH  Google Scholar 

Download references