Generalized Turán number of even linear forests

DOI10.1007/s00373-021-02329-2zbMath1469.05090OpenAlexW3161556680MaRDI QIDQ2042218

Xiutao Zhu, Fangfang Zhang, Yaojun Chen

Publication date: 28 July 2021

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

Full work available at URL: https://doi.org/10.1007/s00373-021-02329-2

zbMATH Keywords

Turán numbergeneralized Turán numbereven linear forests

Mathematics Subject Classification ID

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

Related Items (3)

Generalized Turán number for linear forests ⋮ On the \(A_\alpha\)-spectral radius of graphs without linear forests ⋮ The maximum number of stars in a graph without linear forest

Cites Work

• Unnamed Item
• Unnamed Item
• On the Turán number of forests
• On the maximum number of five-cycles in a triangle-free graph
• Pentagons vs. triangles
• Many cliques in \(H\)-free subgraphs of random graphs
• The maximum number of cliques in graphs without long cycles
• On the number of pentagons in triangle-free graphs
• Some sharp results on the generalized Turán numbers
• 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
• The Maximum Number of Triangles in C_2k+1-Free Graphs
• The Maximum Number of Complete Subgraphs of Fixed Size in a Graph with Given Maximum Degree
• Turán Numbers of Multiple Paths and Equibipartite Forests
• On maximal paths and circuits of graphs
• On the Number of Cycles in a Graph with Restricted Cycle Lengths
• Extensions of the Erdős–Gallai theorem and Luo’s theorem
• Some Theorems on Abstract Graphs
• Many \(T\) copies in \(H\)-free graphs

This page was built for publication: Generalized Turán number of even linear forests