The generalized Turán number of spanning linear forests

DOI10.1007/S00373-021-02403-9zbMath1485.05029arXiv2009.00181OpenAlexW4210342670MaRDI QIDQ2115153

Yanyan Li

Publication date: 15 March 2022

Published in: Graphs and Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

linear forestgeneralized Turán numbershifting method

Mathematics Subject Classification ID

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

Related Items (4)

The Turán number of Berge hypergraphs with stable properties ⋮ The maximum number of complete multipartite subgraphs in graphs with given circumference or matching number ⋮ The maximum spectral radius of graphs without spanning linear forests ⋮ Further results on the generalized Turán number of spanning linear forests

Cites Work

• Unnamed Item
• Unnamed Item
• The maximum number of cliques in graphs without long cycles
• Some sharp results on the generalized Turán numbers
• The formula for Turán number of spanning linear forests
• Generalized Turán problems for even cycles
• The shifting method and generalized Turán number of matchings
• Counting copies of a fixed subgraph in \(F\)-free graphs
• Generalized Turán problems for disjoint copies of graphs
• Planar Turán numbers of short paths
• The Maximum Number of Triangles in C_2k+1-Free Graphs
• On maximal paths and circuits of graphs
• On graphs with randomly deleted edges
• A Generalized Turán Problem and its Applications
• Extensions of the Erdős–Gallai theorem and Luo’s theorem
• The History of Degenerate (Bipartite) Extremal Graph Problems
• Many \(T\) copies in \(H\)-free graphs

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