Problems related to a de Bruijn-Erdös theorem (Q943846): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
(One intermediate revision by one other user not shown) | |||
Property / arXiv ID | |||
Property / arXiv ID: math/0610036 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The Colour Numbers of Complete Graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5610277 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A survey of Sylvester's problem and its generalizations / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5719717 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The Sylvester-Chvátal theorem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Sylvester-Gallai theorem and metric betweenness / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3273607 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5808059 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5734432 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4871765 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4339095 / rank | |||
Normal rank |
Latest revision as of 16:47, 28 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Problems related to a de Bruijn-Erdös theorem |
scientific article |
Statements
Problems related to a de Bruijn-Erdös theorem (English)
0 references
10 September 2008
0 references
The de Bruijn-Erdös theorem referred to in the title of this paper states that every set of \(n\) noncollinear points in the plane determines at least \(n\) lines. The authors investigate a generalization of this theorem in the framework of metric spaces, where lines have to be defined in a suitable way. This leads to some extremal combinatorial problems, and the authors provide partial results.
0 references
combinatorial geometry
0 references
metric space
0 references
metric betweenness
0 references
extremal combinatorial problem
0 references