Work

A De Bruijn-Erdos theorem for chordal graphs

Year: 2012

Type: preprint

Abstract: A special case of a combinatorial theorem of De Bruijn and Erdos asserts that every noncollinear set of n points in the plane determines at least n distinct lines. Chen and Chvatal suggested a possible generalization of this assertion in metric spaces with appropriately defined lines. We prove this generalization in all metric spaces induced by connected chordal graphs.

Source: arXiv (Cornell University)

DOI: 10.48550/arxiv.1201.6376

Authors: Beaudou, Laurent, Bondy, Adrian, Chen, Xiaomin, Chiniforooshan, Ehsan, Chudnovsky, Maria, Chvatal, Vasek, Fraiman, Nicolas, Zwols, Yori

Institutions: Laboratoire d'Informatique, de Modélisation et d'Optimisation des Systèmes, Université Pierre-et-Marie-Curie, Concordia University, Google (United States), Columbia University, McGill University

Language: English

Topic: Limits and Structures in Graph Theory

Subfield: Discrete Mathematics and Combinatorics

Field: Mathematics

Domain: Physical Sciences

Open Access status: green

Funders: National Science Foundation, Canada Research Chairs, Concordia University

Awards: Coloring and Structure, RI: Small: Learning and Inference with Perfect Graphs

OpenAlex ID: W2951275656

Cites: 5

Cited by: 5

Related to: 10