paper

Graphs with few paths of prescribed length between any two vertices

arXiv:1411.0856 · doi:10.1112/blms.12295

Abstract

We use a variant of Bukh's random algebraic method to show that for every natural number there exists a natural number such that, for every , there is a graph with vertices and edges with at most paths of length between any two vertices. A result of Faudree and Simonovits shows that the bound on the number of edges is tight up to the implied constant.

arXiv comment8 pages

References in corpus (1)

Cited by in corpus (15)