De Bruijn-Erdős-type theorems for graphs and posets
From MaRDI portal
Publication:512579
DOI10.1016/j.disc.2017.01.012zbMath1357.05022arXiv1501.06681OpenAlexW2064309369MaRDI QIDQ512579
Guillaume Lagarde, Casey Tompkins, Abhishek Methuku, Pierre Aboulker, David Malec
Publication date: 27 February 2017
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1501.06681
Other designs, configurations (05B30) Combinatorial geometries and geometric closure systems (51D20) Other finite incidence structures (geometric aspects) (51E30) Ordered geometries (ordered incidence structures, etc.) (51G99)
Cites Work
- Unnamed Item
- Lines, betweenness and metric spaces
- The Chen-Chvátal conjecture for metric spaces induced by distance-hereditary graphs
- Problems related to a de Bruijn-Erdös theorem
- Sylvester-Gallai theorem and metric betweenness
- Towards a de Bruijn-Erdős theorem in the \(L_1\)-metric
- A de Bruijn-Erdős theorem for chordal graphs
- Graph metric with no proper inclusion between lines
- Lines in hypergraphs
- Number of lines in hypergraphs
- A de Bruijn-Erdős theorem for 1–2 metric spaces
- A Dual of Dilworth's Decomposition Theorem
This page was built for publication: De Bruijn-Erdős-type theorems for graphs and posets