Problems related to a de Bruijn - Erdős theorem
Xiaomin Chen, Vašek Chvátal
Abstract
De Bruijn and Erdős proved that every noncollinear set of n points in the plane determines at least n distinct lines. We suggest a possible generalization of this theorem in the framework of metric spaces and provide partial results on related extremal combinatorial problems.
Create a lesson
Related papers
On Unavoidable Faces of High-Dimensional Polytopes
Jesús A. De Loera, Ethan X. Fang, Shengtao Guo et al.
Graphs with Long Pseudosimilarity Chains under Consecutive Vertex Deletions
Sergey Ivanov
List coloring C3-free planar graphs with a sparse matching of restricted lists
Stephen G. Hartke, Yupei Li, Joseph Pappe et al.
On the gonality of Kneser graphs
Luis A. Ballinas, Willoughby Caine, D. Blake Hopkins et al.
Localization of the Caro-Wei bound and its applications to bipartiteness
Aida Abiad, Hitesh Kumar, Shivaramakrishna Pragada
Varieties of chain complexes and mixed dimer covers
Portia X. Anderson, Esther Banaian, Melanie J. Ferreri et al.