The formula for Turán number of spanning linear forests

DOI10.1016/J.DISC.2020.111924zbMath1441.05116arXiv1812.01047OpenAlexW2902994263MaRDI QIDQ2185927

Bo Ning, Jian Wang

Publication date: 8 June 2020

Published in: Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

matchingTurán problemslinear forestErdős-Gallai theorem

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75)

Related Items (10)

The Turán numbers of special forests ⋮ The Turán number of Berge hypergraphs with stable properties ⋮ The maximum spectral radius of graphs without spanning linear forests ⋮ The bipartite Turán number and spectral extremum for linear forests ⋮ Spectral extrema of \(\{ K_{k + 1}, \mathcal{L}_s \}\)-free graphs ⋮ The balancing number and generalized balancing number of some graph classes ⋮ On zero-sum spanning trees and zero-sum connectivity ⋮ The maximum number of stars in a graph without linear forest ⋮ Further results on the generalized Turán number of spanning linear forests ⋮ The generalized Turán number of spanning linear forests

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the Turán number of forests
• Turán numbers for disjoint copies of graphs
• Arc coverings of graphs
• A method in graph theory
• On a closure concept in claw-free graphs
• Closure for \(\{K_{1,4},K_{1,4} + e\}\)-free graphs
• Extremal problems on the Hamiltonicity of claw-free graphs
• Proof of the Erdős matching conjecture in a new range
• Conditions for graphs to be path partition optimal
• The Turán number for spanning linear forests
• Long cycles through a linear forest
• What we know and what we do not know about Turán numbers
• The Turán number of disjoint copies of paths
• Spectral analogues of Erdős’ and Moon–Moser’s theorems on Hamilton cycles
• Turán Numbers of Multiple Paths and Equibipartite Forests
• On maximal paths and circuits of graphs
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• On the size of graphs with complete-factors

This page was built for publication: The formula for Turán number of spanning linear forests