The Turań number of \(2P_7\)

DOI10.7151/DMGT.2111zbMath1419.05111arXiv1711.07734OpenAlexW2963199880MaRDI QIDQ2312054

Yongtang Shi, Zhongmei Qin, Yongxin Lan

Publication date: 4 July 2019

Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1711.07734

zbMATH Keywords

extremal graphsTurán number\(2P_7\)

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Related Items (2)

The Turán numbers of special forests ⋮ Turán numbers for disjoint paths

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the Turán number of forests
• The Turán number of the graph \(2P_5\)
• On an extremal problem in graph theory.
• Connected graphs without long paths
• Path Ramsey numbers in multicolorings
• The Turán number of disjoint copies of paths
• Turán Numbers of Multiple Paths and Equibipartite Forests
• On maximal paths and circuits of graphs
• On Independent Complete Subgraphs in a Graph
• On the theory of graphs

This page was built for publication: The Turań number of \(2P_7\)