Premium
Lines in bipartite graphs and in 2‐metric spaces
Author(s) -
Matamala Martín,
Zamora José
Publication year - 2020
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/jgt.22574
Subject(s) - mathematics , combinatorics , bipartite graph , metric space , conjecture , discrete mathematics , real line , metric (unit) , finite set , graph , mathematical analysis , operations management , economics
The line generated by two distinct points, x and y , in a finite metric space M = ( V , d ) , is the set of points given by{ z ∈ V : d ( x , y ) = | d ( x , z ) + d ( z , y ) |or d ( x , y ) = | d ( x , z ) − d ( z , y ) | } .It is denoted byx y ¯ M . A 2‐set { x , y } such thatx y ¯ M = V is called a universal pair and its generated line a universal line . Chen and Chvátal conjectured that in any finite metric space either there is a universal line, or there are at least | V | different (nonuniversal) lines. Chvátal proved that this is indeed the case when the metric space has distances in the set { 0 , 1 , 2 } . Aboulker et al proposed the following strengthenings for Chen and Chvátal conjecture in the context of metric spaces induced by finite graphs: First, the number of lines plus the number of bridges of the graph is at least the number of points. Second, the number of lines plus the number of universal pairs is at least the number of points of the space. In this study, we prove that the first conjecture is true for bipartite graphs different from C 4 or K 2 , 3 , and that the second conjecture is true for metric spaces with distances in the set { 0 , 1 , 2 } .