On the maximum diameter of path-pairable graphs
Combinatorics
2017-07-14 v1
Abstract
A graph is path-pairable if for any pairing of its vertices there exist edge disjoint paths joining the vertices in each pair. We obtain sharp bounds on the maximum possible diameter of path-pairable graphs which either have a given number of edges, or are c- degenerate. Along the way we show that a large family of graphs obtained by blowing up a path is path-pairable, which may be of independent interest.
Keywords
Cite
@article{arxiv.1707.04247,
title = {On the maximum diameter of path-pairable graphs},
author = {Antonio Girao and Gabor Meszaros and Kamil Popielarz and Richard Snyder},
journal= {arXiv preprint arXiv:1707.04247},
year = {2017}
}
Comments
8 pages