A de Bruijn-Erdős theorem for chordal graphs
From MaRDI portal
Publication:2341062
zbMath1310.05072arXiv1201.6376MaRDI QIDQ2341062
Laurent Beaudou, Maria Chudnovsky, Xiaomin Chen, Ehsan Chiniforooshan, Nicolas Fraiman, Vašek Chvátal, Adrian Bondy, Yori Zwols
Publication date: 22 April 2015
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1201.6376
Extremal set theory (05D05) Other designs, configurations (05B30) Distance in graphs (05C12) Erd?s problems and related topics of discrete geometry (52C10) Combinatorial geometries and geometric closure systems (51D20)
Related Items (13)
Solution of the Chen-Chvátal conjecture for specific classes of metric spaces ⋮ Universal lines in graphs ⋮ Lines, betweenness and metric spaces ⋮ A de Bruijn-Erdős theorem for \((q,q-4)\)-graphs ⋮ Graphs with no induced house nor induced hole have the de Bruijn–Erdös property ⋮ Lines in bipartite graphs and in 2‐metric spaces ⋮ A New Class of Graphs That Satisfies the Chen‐Chvátal Conjecture ⋮ Towards a de Bruijn-Erdős theorem in the \(L_1\)-metric ⋮ The Chen-Chvátal conjecture for metric spaces induced by distance-hereditary graphs ⋮ Number of lines in hypergraphs ⋮ De Bruijn-Erdős-type theorems for graphs and posets ⋮ Chen and Chvátal's conjecture in tournaments ⋮ Betweenness structures of small linear co-size
Cites Work
- On rigid circuit graphs
- The Sylvester-Chvátal theorem
- 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 1–2 metric spaces
- A de Bruijn - Erd\H{o}s theorem and metric spaces
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A de Bruijn-Erdős theorem for chordal graphs