Article
Paths of Length Four
Discrete Mathematics
Document Type
Article
Publication Date
4-1-2003
Keywords
- Complete bipartite graphs
Disciplines
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).
DOI
http://dx.doi.org/10.1016/S0012-365X(02)00878-6
Comments
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
Subjects - Topical (LCSH)
Bipartite graphs
Genre/Form
articles
Type
Text
Rights
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.
Language
English
Format
application/pdf
Citation Information
Béla Bollobás and Amites Sarkar. "Paths of Length Four" Discrete Mathematics Vol. 265 Iss. 1-3 (2003) p. 357 - 363 Available at: http://works.bepress.com/amites_sarkar/8/
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