The Turán number of the graph \(2P_5\)
From MaRDI portal
Publication:726648
DOI10.7151/dmgt.1883zbMath1339.05195OpenAlexW2338484304MaRDI QIDQ726648
Halina Bielak, Sebastian Kieliszek
Publication date: 13 July 2016
Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.7151/dmgt.1883
Related Items (9)
The Turán numbers of special forests ⋮ 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 ⋮ The Turań number of \(2P_7\) ⋮ Extremal graphs for two vertex-disjoint copies of a clique
Cites Work
This page was built for publication: The Turán number of the graph \(2P_5\)