Chen-Chvátal Conjecture for Graphs of Diameter 3

Fuente: arXiv
Salvato in:
Dettagli Bibliografici
Autori principali: Matamala, Martín, Villarroel-Sepúlveda, Luciano
Natura: Preprint
Pubblicazione: 2025
Soggetti:
Accesso online:
Tags: Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
_version_ 1866915672976523264
author Matamala, Martín
Villarroel-Sepúlveda, Luciano
author_facet Matamala, Martín
Villarroel-Sepúlveda, Luciano
contents In 2008, Chen and Chvátal conjectured that in every finite metric space of $n$ points, there are at least $n$ distinct lines, or the whole set of points is a line. This is a generalization of a classical result in the Euclidean plane. The Chen-Chvátal conjecture is open even in metric spaces induced by connected graphs. In 2018, it was asked by Chvátal whether graphs of diameter three satisfy the conjecture. In this work, we find all graphs of diameter three having fewer lines than vertices. As a direct consequence, we prove that graphs of diameter three satisfy the Chen-Chvátal conjecture.
format Preprint
id arxiv_https___arxiv_org_abs_2512_12047
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle Chen-Chvátal Conjecture for Graphs of Diameter 3
Matamala, Martín
Villarroel-Sepúlveda, Luciano
Combinatorics
05C12, 05C75
In 2008, Chen and Chvátal conjectured that in every finite metric space of $n$ points, there are at least $n$ distinct lines, or the whole set of points is a line. This is a generalization of a classical result in the Euclidean plane. The Chen-Chvátal conjecture is open even in metric spaces induced by connected graphs. In 2018, it was asked by Chvátal whether graphs of diameter three satisfy the conjecture. In this work, we find all graphs of diameter three having fewer lines than vertices. As a direct consequence, we prove that graphs of diameter three satisfy the Chen-Chvátal conjecture.
title Chen-Chvátal Conjecture for Graphs of Diameter 3
topic Combinatorics
05C12, 05C75
url https://arxiv.org/abs/2512.12047