The Turán number of the graph
Halina Bielak, Sebastian Kieliszek (2014)
Annales Universitatis Mariae Curie-Sklodowska, sectio A – Mathematica
Similarity:
Let denote the maximum number of edges in a graph on vertices which does not contain as a subgraph. Let denote a path consisting of vertices and let denote disjoint copies of . In this paper we count .