Complete bipartite graphs
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).
Required Publisher's Statement
Copyright © 2003 Elsevier Science B.V.
Bollobás, Béla and Sarkar, Amites, "Paths of Length Four" (2003). Mathematics Faculty Publications. 82.
Subjects - Topical (LCSH)
Copying of this document in whole or in part is allowable only for scholarly purposes. It is understood, however, that any copying or publication of this document for commercial purposes, or for financial gain, shall not be allowed without the author’s written permission.
This is the authors' post-refereed version of the article. Here is a link to the publisher's version: http://www.sciencedirect.com/science/article/pii/S0012365X02008786