Some combinatorial problems in the plane (Q1133547): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q5790167 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The orchard problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On a Problem of Groübaum / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On some problems of elementary and combinatorial geometry / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the Number of Ordinary Lines Determined by n Points / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The Lines and Planes Connecting the Points of a Finite Set / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the Sets of Directions Determined by n Points / rank | |||
Normal rank |
Latest revision as of 03:45, 13 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Some combinatorial problems in the plane |
scientific article |
Statements
Some combinatorial problems in the plane (English)
0 references
1978
0 references
The author prove (among other things) the following remarkable theorem: Let S be a finite set of n points in the plane, not all on one line, and let \(t_i\) denote the number of lines which contain exactly i points of S for i=2,3,\dots,n-1. If \(n\geq 25\), then \(\max\{t_2,t_3\}\geq n-1\). Also, for all n, if \(t_2< n-1\), then \(t_3\geq(n^2-12n-16)/24\). Finally, \(\max\{t_2,t_3,\dots,t_{n-1}\}=\max\{t_2,t_3\}\). The paper includes results in a similar vein together with various conjectures and their current status.
0 references
Problems
0 references
finite set of points in the plane
0 references
lines
0 references