The Turán number of P₉ P₇

DOI10.1007/S40314-024-02779-3MaRDI QIDQ6569093FDOQ6569093

Authors: Xiaona Fang, Lihua You 

Publication date: 8 July 2024

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

Recommendations

• The Turán numbers of special forests
• On the Turán number of forests
• The Turań number of \(2P_7\)
• Turán numbers of multiple paths and equibipartite forests

zbMATH Keywords

extremal graphlinear forestTurán number

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Connected graphs without long paths
• Eine Extremalaufgabe aus der Graphentheorie.
• On maximal paths and circuits of graphs
• On the Turán number of forests
• On the theory of graphs
• Path Ramsey numbers in multicolorings
• The Turań number of \(2P_7\)
• The Turán number of disjoint copies of paths
• The Turán number of the graph 3P5
• The Turán number of the graph \(2P_5\)
• The Turán numbers of special forests
• Turán numbers for disjoint paths
• Turán numbers of multiple paths and equibipartite forests
• Vraagstuk XXVIII.

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

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