The Turàn number of the graph 3P4

DOI10.2478/UMCSMATH-2014-0003zbMath1292.05143OpenAlexW2059519279MaRDI QIDQ4980028

Halina Bielak, Sebastian Kieliszek

Publication date: 20 June 2014

Published in: Annales UMCS, Mathematica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2478/umcsmath-2014-0003

zbMATH Keywords

Turán numberforests

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Paths and cycles (05C38)

Related Items (8)

The Turán number of disjoint copies of paths ⋮ The Turán number of the graph 3P5 ⋮ Turán numbers of vertex-disjoint cliques in \(r\)-partite graphs ⋮ Turán numbers for disjoint paths ⋮ The complete value of the Turán number of \(3K_{p+1}\) ⋮ On extremal hypergraphs for forests of tight paths ⋮ The lower and upper bounds of Turán number for odd wheels ⋮ Extremal graphs for two vertex-disjoint copies of a clique

Cites Work

• Unnamed Item
• Turán numbers for disjoint copies of graphs
• Path Ramsey numbers in multicolorings
• Turán Numbers of Multiple Paths and Equibipartite Forests
• On maximal paths and circuits of graphs

This page was built for publication: The Turàn number of the graph 3P4