The maximum number of times the same distance can occur among the vertices of a convex \(n\)-gon is \(O(n\log n)\) (Q5937134): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1006/jcta.2000.3133 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1975526544 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A lower bound on the number of unit distances between the vertices of a convex polygon / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The maximum number of unit distances in a convex \(n\)-gon / rank | |||
Normal rank | |||
Latest revision as of 18:12, 3 June 2024
scientific article; zbMATH DE number 1618559
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The maximum number of times the same distance can occur among the vertices of a convex \(n\)-gon is \(O(n\log n)\) |
scientific article; zbMATH DE number 1618559 |
Statements
The maximum number of times the same distance can occur among the vertices of a convex \(n\)-gon is \(O(n\log n)\) (English)
0 references
30 October 2001
0 references
This note contains a very short proof of \textit{Z. Füredi}'s theorem [J. Comb. Theory Ser. A 55, 316-320 (1990; Zbl 0742.52010)], stated in the title.
0 references
unit distances
0 references
vertices of a convex \(n\)-gon
0 references
