A Combinatorial Distinction Between Unit Circles and Straight Lines: How Many Coincidences Can they Have? (Q3552498): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Arrangements of Lines with a Large Number of Triangles / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Circle grids and bipartite graphs of distances / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: n points in the plane can determine \(n^{3/2}\) unit circles / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Repeated angles in the plane and related problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Crossing Numbers and Hard Erdős Problems in Discrete Geometry / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Extremal problems in discrete geometry / rank | |||
Normal rank |
Revision as of 17:58, 2 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A Combinatorial Distinction Between Unit Circles and Straight Lines: How Many Coincidences Can they Have? |
scientific article |
Statements
A Combinatorial Distinction Between Unit Circles and Straight Lines: How Many Coincidences Can they Have? (English)
0 references
22 April 2010
0 references
incidence graph
0 references
triple point
0 references
parametrized family of curves
0 references
ochard problem
0 references
Szmerédi-Trotter bound
0 references
surface theorem
0 references