Turán numbers for disjoint paths

DOI10.1002/jgt.22710zbMath1522.05219arXiv1611.00981OpenAlexW3182111984WikidataQ114236149 ScholiaQ114236149MaRDI QIDQ6056755

Long-Tu Yuan, Xiao Dong Zhang

Publication date: 4 October 2023

Published in: Journal of Graph Theory (Search for Journal in Brave)

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

zbMATH Keywords

extremal graphTurán numberdisjoint path

Mathematics Subject Classification ID

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

Related Items (5)

The Turán numbers of special forests ⋮ Generalized Turán number for linear forests ⋮ The bipartite Turán number and spectral extremum for linear forests ⋮ The complete value of the Turán number of \(3K_{p+1}\) ⋮ Extremal graphs for two vertex-disjoint copies of a clique

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Improved bounds for Erdős' matching conjecture
• On the Turán number of forests
• On the maximum number of edges in a hypergraph with given matching number
• Turán numbers for disjoint copies of graphs
• The Turán number of the graph \(2P_5\)
• Connected graphs without long paths
• Path Ramsey numbers in multicolorings
• The Turań number of \(2P_7\)
• The Turán number of disjoint copies of paths
• The Size of a Hypergraph and its Matching Number
• A survey of Turán problems for expansions
• Turán Numbers of Multiple Paths and Equibipartite Forests
• Turán Numbers for Forests of Paths in Hypergraphs
• On maximal paths and circuits of graphs
• The Turàn number of the graph 3P4
• Extremal Numbers for Odd Cycles
• The History of Degenerate (Bipartite) Extremal Graph Problems
• On Independent Complete Subgraphs in a Graph
• A proof for a conjecture of Gorgol

This page was built for publication: Turán numbers for disjoint paths