The Turán number of P₉ P₇

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

Xiaona Fang, Lihua You

Publication date: 8 July 2024

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

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

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)