On the public citation graph
The orchard problem
0 signed · 77 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/978-3-663-16027-4_7openalex-snapshot
Konfigurationen der Projektiven Geometrie
inferredcites →https://doi.org/10.1007/bf01446324openalex-snapshot
Ueber eine besondere Curve 3ter Ordnung nnd eine einfache Erzeugungsart der allgemeinen Curve 3ter Ordnung
inferredcites →https://doi.org/10.1007/bf01693776openalex-snapshot
Über die Ausartungen der Schröterschen Konstruktion der ebenen Kurven dritter Ordnung
inferredcites →https://doi.org/10.1016/0012-365x(72)90027-1openalex-snapshot
Upper bounds for constant weight error correcting codes
inferredcites →https://doi.org/10.1090/s0002-9904-1950-09407-5openalex-snapshot
Self-dual configurations and regular graphs
inferredcites →https://doi.org/10.1109/tit.1962.1057714openalex-snapshot
A new upper bound for error-correcting codes
inferredcites →https://doi.org/10.1109/tit.1963.1057841openalex-snapshot
Improved asymptotic bounds for error-correcting codes
inferredcites →https://doi.org/10.1109/tit.1964.1053677openalex-snapshot
Upper bounds for fixed-weight codes of specified minimum distance (Corresp.)
inferredcites →https://doi.org/10.1109/tit.1967.1053995openalex-snapshot
Some additional upper bounds for fixed-weight codes of specified minimum distance
inferredcites →https://doi.org/10.1109/tit.1971.1054656openalex-snapshot
On upper bounds for unrestricted binary-error-correcting codes
inferredcites →https://doi.org/10.1515/crelle-1891-189110711openalex-snapshot
Ueber die Schrötersche Construction der ebenen Curven dritter Ordnung
inferredcites →https://doi.org/10.1515/crll.1859.56.326openalex-snapshot
Ueber eine Steinersche combinatorische Aufgabe, welche im 45sten Bande dieses Journals, Seite 181, gestellt worden ist.
inferredcites →https://doi.org/10.2140/pjm.1972.40.617openalex-snapshot
Simple points in pseudoline arrangements
inferredcites →https://doi.org/10.2307/2300863openalex-snapshot
A Treatise on Algebraic Plane Curves.
inferredcites →https://doi.org/10.2307/2317365openalex-snapshot
Elements of the Theory of Algebraic Curves.
inferredcites →https://doi.org/10.4153/cjm-1958-024-6openalex-snapshot
On the Number of Ordinary Lines Determined by n Points
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/jctb.1996.0006openalex-snapshot
The Maximum Number of Triangles in Arrangements of Pseudolines
inferred← citeshttps://doi.org/10.1007/978-1-4757-9286-7_7openalex-snapshot
Arrangements of Lines and Algebraic Surfaces
inferred← citeshttps://doi.org/10.1007/978-3-642-61711-9_31openalex-snapshot
Some examples of algebraic surfaces
inferred← citeshttps://doi.org/10.1007/978-3-642-61711-9_32openalex-snapshot
Arrangements of lines and algebraic surfaces
inferred← citeshttps://doi.org/10.1007/bf00156478openalex-snapshot
On the number of regions determined by n lines in the projective plane
inferred← citeshttps://doi.org/10.1007/bf01864160openalex-snapshot
Matchings and covers in hypergraphs
inferred← citeshttps://doi.org/10.1007/bf02112289openalex-snapshot
A survey of Sylvester's problem and its generalizations
inferred← citeshttps://doi.org/10.1007/bf02831757openalex-snapshot
Curves with nodes, cusps and ordinary triple points
inferred← citeshttps://doi.org/10.1007/bf02924814openalex-snapshot
Geometria combinatoria e geometrie finite
inferred← citeshttps://doi.org/10.1007/bfb0088660openalex-snapshot
Some combinational problems in geometry
inferred← citeshttps://doi.org/10.1007/s00454-002-2887-0openalex-snapshot
Restricted Point Configurations with Many Collinear {k}-Tuplets
inferred← citeshttps://doi.org/10.1007/s00454-013-9518-9openalex-snapshot
On Sets Defining Few Ordinary Lines
inferred← citeshttps://doi.org/10.1007/s00454-013-9526-9openalex-snapshot
Many Collinear $$k$$ k -Tuples with no $$k+1$$ k + 1 Collinear Points
inferred← citeshttps://doi.org/10.1007/s10711-015-0091-7openalex-snapshot
Line arrangements with the maximal number of triple points
inferred← citeshttps://doi.org/10.1007/s10998-006-0027-yopenalex-snapshot
On some points-and-lines problems and configurations
inferred← citeshttps://doi.org/10.1007/s10998-017-0224-xopenalex-snapshot
On the Sylvester–Gallai and the orchard problem for pseudoline arrangements
inferred← citeshttps://doi.org/10.1016/0012-365x(79)90018-9openalex-snapshot
Triangles in arrangements of lines
inferred← citeshttps://doi.org/10.1016/0012-365x(80)90096-5openalex-snapshot
Proof of a conjecture of Burr, Grünbaum, and Sloane
inferred← citeshttps://doi.org/10.1016/0012-365x(88)90057-xopenalex-snapshot
Grünbaum's gap conjecture
inferred← citeshttps://doi.org/10.1016/0097-3165(75)90007-2openalex-snapshot
A problem of Zarankiewicz
inferred← citeshttps://doi.org/10.1016/0097-3165(77)90022-xopenalex-snapshot
Triangles in arrangements of lines
inferred← citeshttps://doi.org/10.1016/0097-3165(78)90085-7openalex-snapshot
Some combinatorial problems in the plane
inferred← citeshttps://doi.org/10.1016/j.dam.2015.06.016openalex-snapshot
Nordhaus–Gaddum-type problems for lines in hypergraphs
inferred← citeshttps://doi.org/10.1016/j.ffa.2020.101756openalex-snapshot
Orchards in elliptic curves over finite fields
inferred← citeshttps://doi.org/10.1016/s0195-6698(03)00031-3openalex-snapshot
Polycyclic configurations
inferred← citeshttps://doi.org/10.1016/s0195-6698(84)80026-8openalex-snapshot
Geometrical Solution of an Intersection Problem for Two Hypergraphs
inferred← citeshttps://doi.org/10.1016/s0304-0208(08)72816-0openalex-snapshot
Some Old and New Problems in Combinatorial Geometry
inferred← citeshttps://doi.org/10.1017/9781108539180openalex-snapshot
Forbidden Configurations in Discrete Geometry
inferred← citeshttps://doi.org/10.1017/cbo9780511976247openalex-snapshot
Graph-based Natural Language Processing and Information Retrieval
inferred← citeshttps://doi.org/10.1080/0025570x.1980.11976861openalex-snapshot
The Tree Planting Problem on a Sphere
inferred← citeshttps://doi.org/10.1090/conm/009/655974openalex-snapshot
Some examples of algebraic surfaces
inferred← citeshttps://doi.org/10.1090/s0002-9939-1984-0760946-2openalex-snapshot
Arrangements of Lines with a Large Number of Triangles
inferred← citeshttps://doi.org/10.1111/j.1749-6632.1985.tb14533.xopenalex-snapshot
PROBLEMS AND RESULTS IN COMBINATORIAL GEOMETRYa
inferred← citeshttps://doi.org/10.1111/j.1749-6632.1985.tb14538.xopenalex-snapshot
PROBLEMS ON EXTREMAL PROPERTIES OF A FINITE SET OF POINTS
inferred← citeshttps://doi.org/10.1137/0404019openalex-snapshot
Maximal Independent Subsets in Steiner Systems and in Planar Sets
inferred← citeshttps://doi.org/10.1137/s0097539703433900openalex-snapshot
Pseudo-Line Arrangements: Duality, Algorithms, and Applications
inferred← citeshttps://doi.org/10.1137/s0097539797315410openalex-snapshot
New Lower Bounds for Convex Hull Problems in Odd Dimensions
inferred← citeshttps://doi.org/10.1145/237218.237225openalex-snapshot
New lower bounds for convex hull problems in odd dimensions
inferred← citeshttps://doi.org/10.2140/iig.2024.21.117openalex-snapshot
The generalized Sylvester’s and orchard problems via discriminantal arrangement
inferred← citeshttps://doi.org/10.2140/iig.2025.22.47openalex-snapshot
Singular plane curves: freeness and combinatorics
inferred← citeshttps://doi.org/10.4171/rsmup/136-13openalex-snapshot
On the Sylvester–Gallai theorem for conics
inferred← citeshttps://doi.org/10.48550/arxiv.1107.0327openalex-snapshot
Many collinear k-tuples with no k+1 collinear points
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.