The Turán number of \(P_9 \cup P_7\)

DOI10.1007/s40314-024-02779-3MaRDI QIDQ6569093

Xiaona Fang, Lihua You

Publication date: 8 July 2024

Published in: Computational and Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

extremal graphTurán numberlinear forest

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30)

Cites Work

• Unnamed Item
• On the Turán number of forests
• The Turán number of the graph \(2P_5\)
• Connected graphs without long paths
• Vraagstuk XXVIII.
• Path Ramsey numbers in multicolorings
• The Turán numbers of special forests
• The Turań number of \(2P_7\)
• The Turán number of disjoint copies of paths
• Eine Extremalaufgabe aus der Graphentheorie.
• Turán Numbers of Multiple Paths and Equibipartite Forests
• On maximal paths and circuits of graphs
• The Turán number of the graph 3P5
• On the theory of graphs
• Turán numbers for disjoint paths

This page was built for publication: The Turán number of \(P_9 \cup P_7\)