The Turán number of the graph $3P_4$

ArticleOriginal scientific text

Title

Authors ,

Let

e x (n, G)

denote the maximum number of edges in a graph on

n

vertices which does not contain

G

as a subgraph. Let

P_{i}

denote a path consisting of

i

vertices and let

m P_{i}

denote

m

disjoint copies of

P_{i}

. In this paper we count

e x (n, 3 P_{4})

.

Bushaw, N., Kettle, N., Turán numbers of multiple paths and equibipartite forests, Combin. Probab. Comput. 20 (2011), 837-853.
Erdős, P., Gallai, T., On maximal paths and circuits of graphs, Acta Math. Acad. Sci. Hungar. 10 (1959), 337-356.
Faudree, R. J., Schelp, R. H., Path Ramsey numbers in multicolorings, J. Combin. Theory Ser. B 19 (1975), 150-160.
Gorgol, I., Turán numbers for disjoint copies of graphs, Graphs Combin. 27 (2011), 661-667.
Harary, F., Graph Theory, Addison-Wesley, Mass.-Menlo Park, Calif.-London, 1969.