Further results on the generalized Turán number of spanning linear forests

DOI10.1007/s40840-022-01412-yzbMath1504.05142OpenAlexW4309907337MaRDI QIDQ2107129

Leilei Zhang

Publication date: 1 December 2022

Published in: Bulletin of the Malaysian Mathematical Sciences Society. Second Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s40840-022-01412-y

zbMATH Keywords

minimum degreegeneralized Turán numberspanning linear forests

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
• Unnamed Item
• Stability in the Erdős-Gallai theorems on cycles and paths
• Stability results on the circumference of a graph
• A method in graph theory
• The maximum number of cliques in graphs without long cycles
• The Turán number for spanning linear forests
• Maximizing the number of cliques in graphs with given matching number
• Some sharp results on the generalized Turán numbers
• The generalized Turán number of spanning linear forests
• The formula for Turán number of spanning linear forests
• Generalized Turán problems for even cycles
• The maximum number of copies of \(K_{r,s}\) in graphs without long cycles or paths
• The shifting method and generalized Turán number of matchings
• Generalized Turán problems for disjoint copies of graphs
• The Maximum Number of Triangles in C_2k+1-Free Graphs
• On maximal paths and circuits of graphs
• Extensions of a theorem of Erdős on nonhamiltonian graphs
• Extensions of the Erdős–Gallai theorem and Luo’s theorem
• The maximum number of $P_\ell$ copies in $P_k$-free graphs
• Many \(T\) copies in \(H\)-free graphs