论文信息 - Connected graphs without long paths

Connected graphs without long paths

We determine the maximum number of edges in a connected graph with n vertices if it contains no path with k+1 vertices. We also determine the extremal graphs.

[1] Béla Bollobás,et al. Graphs with large maximum degree containing no odd cycles of a given length , 2003, J. Comb. Theory, Ser. B.

[2] P. Erdos,et al. On maximal paths and circuits of graphs , 1959 .

[3] G. Dirac. Some Theorems on Abstract Graphs , 1952 .

[4] Richard H. Schelp,et al. Path Ramsey numbers in multicolorings , 1975 .