Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Geometry and Topology,Theoretical Computer Science
Reference35 articles.
1. Bacharach, I.: Ueber den Cayley’schen Schnittpunktsatz. Math. Ann. 26, 275–299 (1886)
2. Beck, J.: On the lattice property of the plane and some problems of Dirac, Motzkin, and Erdos in combinatorial geometry. Combinatorica 3, 281–297 (1983)
3. Bix, R.: Conics and Cubics: A Concrete Introduction to Algebraic Curves. Undergraduate Texts in Mathematics, 2nd edn. Springer, New York (2006)
4. Borwein, P., Moser, W.O.J.: A survey of Sylvester’s problem and its generalizations. Aequationes Math. 40(2–3), 111–135 (1990)
5. Burr, S., Grünbaum, B., Sloane, N.J.: The orchard problem. Geom. Dedicata 2, 397–424 (1974)
Cited by
55 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. The generalized Sylvester’s and orchard
problems via discriminantal arrangement;Innovations in Incidence Geometry: Algebraic, Topological and Combinatorial;2024-07-25
2. Strong Algebras and Radical Sylvester-Gallai Configurations;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10
3. Line arrangements with many triple points;Rendiconti del Circolo Matematico di Palermo Series 2;2024-05-16
4. On the Structure of Pointsets with Many Collinear Triples;Discrete & Computational Geometry;2023-11-02
5. On Triple Lines and Cubic Curves: The Orchard Problem Revisited;Discrete & Computational Geometry;2023-10-05