A Turan-type problem on distances in graphs
classification
🧮 math.CO
keywords
verticesdistancedistancesgraphsproblemconjecturesfirstgraph
read the original abstract
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 at pairwise distance k has at most (n-k+1)^2/4 pairs of vertices at distance k.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.