Author/Authors :
Béla Bollob?s، نويسنده , , Amites Sarkar، نويسنده ,
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).
