Paths of length four

Authors

Béla Bollobás, Institute for Advanced StudiesFollow
Amites Sarkar, Philips Research

Abstract

For each sufficiently large m, we determine the unique graph of size m with the maximum number of paths of length four. If m is even, this is the complete bipartite graph K(m/2,2). © 2003 Elsevier Science B.V.

Publication Title

Discrete Mathematics

Recommended Citation

Bollobás, B., & Sarkar, A. (2003). Paths of length four. Discrete Mathematics, 265 (1-3), 357-363. https://doi.org/10.1016/S0012-365X(02)00878-6