The Turán number of the graph \(2P_5\)
type: Item
instance of: scholarly article
title: The Turán number of the graph \(2P_5\)
zbMATH Open document ID: 1339.05195
author: Halina Bielak
author: Sebastian Kieliszek
publication date: 2016-07-13T00:00:00Z
Mathematics Subject Classification ID: 05C35
Mathematics Subject Classification ID: 05C38
Mathematics Subject Classification ID: 05C05
zbMATH DE Number: 6603178
zbMATH Keywords: forest
zbMATH Keywords: Turán number
MaRDI profile type: Publication
full work available at URL: dmgt.1883
OpenAlex ID: W2338484304
cites work: Turán Numbers of Multiple Paths and Equibipartite Forests
cites work: On maximal paths and circuits of graphs
cites work: Path Ramsey numbers in multicolorings
cites work: Turán numbers for disjoint copies of graphs
cites work: Q5572939
DOI: 10.7151/DMGT.1883
published in: Discussiones Mathematicae Graph Theory
Recommended article: The Turán number of the graph 3P5
Recommended article: Turán numbers T(n,5,3) $T(n,5,3)$ and graphs without induced 5‐cycles
Recommended article: The Turàn number of the graph 3P4
Recommended article: Turán Graphs and the Number of Colorings
Recommended article: Q6072061
Recommended article: Turán numbers of theta graphs
Recommended article: Q3385121
Recommended article: On the Turán number of theta graphs
Recommended article: Q4784267
Recommended article: Turán numbers of bipartite graphs plus an odd cycle
description: scientific article; zbMATH DE number 6603178