The Tur\'an number of the square of a path
Abstract
The Tur\'an number of a graph H, ex(n,H), is the maximum number of edges in a graph on n vertices which does not have H as a subgraph. Let Pk be the path with k vertices, the square P2k of Pk is obtained by joining the pairs of vertices with distance one or two in Pk. The powerful theorem of Erdos, Stone and Simonovits determines the asymptotic behavior of ex(n,P2k). In the present paper, we determine the exact value of ex(n,P25) and ex(n,P26) and pose a conjecture for the exact value of ex(n,P2k).
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.