The orchard problem

DOI10.1007/BF00147569zbMath0311.05024OpenAlexW2056196311WikidataQ56450709 ScholiaQ56450709MaRDI QIDQ1219291

N. J. A. Sloane, Branko Grünbaum, Stefan A. Burr

Publication date: 1974

Published in: Geometriae Dedicata (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00147569

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Exact enumeration problems, generating functions (05A15) Permutations, words, matrices (05A05) History of mathematics in the 20th century (01A60) Other designs, configurations (05B30) Combinatorial structures in finite projective spaces (51E20) History of mathematics in the 19th century (01A55) Elliptic functions and integrals (33E05) Graph theory (05Cxx) Elementary number theory (11Axx)

Related Items

Polycyclic configurations ⋮ Curves with nodes, cusps and ordinary triple points ⋮ Line arrangements with the maximal number of triple points ⋮ A survey of Sylvester's problem and its generalizations ⋮ Grünbaum's gap conjecture ⋮ On the configurations of nine points on a cubic curve ⋮ On sets defining few ordinary lines ⋮ Lines, circles, planes and spheres ⋮ Many collinear \(k\)-tuples with no \(k+1\) collinear points ⋮ Geometria combinatoria e geometrie finite ⋮ Some combinatorial problems in the plane ⋮ Proof of a conjecture of Burr, Grünbaum, and Sloane ⋮ Nordhaus-Gaddum-type problems for lines in hypergraphs ⋮ Research problems ⋮ Unnamed Item ⋮ Orchards in elliptic curves over finite fields ⋮ Triangles in arrangements of lines ⋮ A problem of Zarankiewicz ⋮ On the Number of Ordinary Conics ⋮ Matchings and covers in hypergraphs ⋮ Triangles in arrangements of lines ⋮ Geometrical solution of an intersection problem for two hypergraphs

This page was built for publication: The orchard problem