| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4650437 | Discrete Mathematics | 2008 | 8 Pages |
Abstract
We determine the maximum number of edges in a connected graph with n vertices if it contains no path with k+1k+1 vertices. We also determine the extremal graphs.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
P.N. Balister, E. Győri, J. Lehel, R.H. Schelp,