机构:
Univ Cambridge, Dept Pure Math & Math Stat, Ctr Math Sci, Cambridge CB3 0WB, EnglandUniv Cambridge, Dept Pure Math & Math Stat, Ctr Math Sci, Cambridge CB3 0WB, England
Tyomkyn, Mykhaylo
[1
]
Uzzell, Andrew J.
论文数: 0引用数: 0
h-index: 0
机构:
Univ Memphis, Dept Math Sci, Memphis, TN 38152 USAUniv Cambridge, Dept Pure Math & Math Stat, Ctr Math Sci, Cambridge CB3 0WB, England
Uzzell, Andrew J.
[2
]
机构:
[1] Univ Cambridge, Dept Pure Math & Math Stat, Ctr Math Sci, Cambridge CB3 0WB, England
[2] Univ Memphis, Dept Math Sci, Memphis, TN 38152 USA
We suggest a new type of problem about distances in graphs and make several conjectures. As a first step towards proving them, we show that for sufficiently large values of n and k, a graph on n vertices that has no three vertices pairwise at distance k has at most (n - k + 1)(2)/4 pairs of vertices at distance k.
机构:
Tel Aviv Univ, Sch Math Sci, Tel Aviv, IsraelTel Aviv Univ, Sch Math Sci, Tel Aviv, Israel
Krivelevich, Michael
论文数: 引用数:
h-index:
机构:
Kronenberg, Gal
Mond, Adva
论文数: 0引用数: 0
h-index: 0
机构:
Tel Aviv Univ, Sch Math Sci, Tel Aviv, Israel
Univ Cambridge, Ctr Math Sci, Dept Pure Math & Math Stat, Cambridge, EnglandTel Aviv Univ, Sch Math Sci, Tel Aviv, Israel
Mond, Adva
JOURNAL OF THE LONDON MATHEMATICAL SOCIETY-SECOND SERIES,
2023,
107
(04):
: 1519
-
1551