The Turán number of the graph 3P5

DOI10.2298/FIL2010395FzbMath1499.05306MaRDI QIDQ5081188

Yumei Hu, Liquan Feng

Publication date: 13 June 2022

Published in: Filomat (Search for Journal in Brave)

zbMATH Keywords

extremal graphTurán numberdisjoint paths

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30) Paths and cycles (05C38)

Cites Work

• Unnamed Item
• Unnamed Item
• On the Turán number of forests
• The Turán number of the graph \(2P_5\)
• 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
• The Turàn number of the graph 3P4
• On Independent Complete Subgraphs in a Graph

This page was built for publication: The Turán number of the graph 3P5