The number and average length of subpaths in graphs
Stijn Cambie
Abstract
We study extremal questions on the average length and the number of subpaths in a graph. In particular, we prove the questions of Jamison (from 1983, 1984) for the analogous concept of the average length of a subpath. Among other results, we prove that Kn maximizes the average path length.
Create a lesson
Related papers
Simple Cayley permutations
Giulio Cerbai, Anders Claesson
Transfer of difference structures: a new semidirect product framework
Sophie Huczynska, Struan McCartney, Carys Williams
Connected Mutual-Visibility in Graphs
Tonny K B, Shikhi M
Decomposing Gorenstein polytopes of large index
Johannes Knupfer, Benjamin Nill
A non-trivial bound for 3AP-intersecting families
Peter Keevash
Solution to a conjecture on integral uniform hypercycles
Joyentanuj Das, Iswar Mahato