Abstract
For each n and for each r less than or equal to n - 3 we obtain the maximum number of edges of a connected graph with n vertices which cannot be spanned by r disjoint paths. We also obtain all connected graphs which achieve the maximum, of which there are two types. (C) 1999 Elsevier Science B.V. All rights reserved.