The Turán number of the graph 3P₄

DOI10.2478/UMCSMATH-2014-0003MaRDI QIDQ4980028zbMATH OpenOpenAlexFDO

Authors Halina Bielak, Sebastian Kieliszek

Publication date 20 June 2014

Published in Annales Universitatis Mariae Curie-Sklodowska, sectio A – Mathematica (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported

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

zbMATH Keywords

forestsTurán number

Mathematics Subject Classification ID

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

Recommendations

• The Turán number of disjoint copies of paths
• A proof for a conjecture of Gorgol
• Turán numbers of multiple paths and equibipartite forests
• Turán numbers for disjoint paths
• Turán numbers for disjoint copies of graphs

Cites work

• scientific article; zbMATH DE number 3290993 (Why is no real title available?)
• On maximal paths and circuits of graphs
• Path Ramsey numbers in multicolorings
• Turán numbers for disjoint copies of graphs
• Turán numbers of multiple paths and equibipartite forests

Cited in

(14)

• Turán numbers of vertex-disjoint cliques in r-partite graphs
• The lower and upper bounds of Turán number for odd wheels
• Extremal graphs for two vertex-disjoint copies of a clique
• On extremal hypergraphs for forests of tight paths
• The Turán number of disjoint copies of paths
• A Note on the Number of Triangles in Graphs Without the Suspension of a Path on Four Vertices
• The Turán number of the graph 3P5
• scientific article; zbMATH DE number 2188355 (Why is no real title available?)
• A proof for a conjecture of Gorgol
• Turán numbers for disjoint paths
• The complete value of the Turán number of \(3K_{p+1}\)
• On the Turán numbers of linear forests in bipartite graphs
• Turán number of two vertex-disjoint copies of cliques.
• The Turán number of the graph \(2P_5\)

This page was built for publication: The Turán number of the graph \(3P_4\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4980028)