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

DOI10.1007/S40840-022-01412-YMaRDI QIDQ2107129zbMATH OpenOpenAlexFDO

Authors 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 degreespanning linear forestsgeneralized Turán number

Mathematics Subject Classification ID

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

Recommendations

• The generalized Turán number of linear forests
• Generalized Turán number for linear forests
• The generalized Turán number of spanning linear forests
• The Turán number for spanning linear forests
• The formula for Turán number of spanning linear forests

Cites work

• scientific article; zbMATH DE number 3652374 (Why is no real title available?)
• scientific article; zbMATH DE number 3050594 (Why is no real title available?)
• A method in graph theory
• Extensions of a theorem of Erdős on nonhamiltonian graphs
• Extensions of the Erdős-Gallai theorem and Luo's theorem
• Generalized Turán problems for disjoint copies of graphs
• Generalized Turán problems for even cycles
• Many \(T\) copies in \(H\)-free graphs
• Maximizing the number of cliques in graphs with given matching number
• On maximal paths and circuits of graphs
• Some sharp results on the generalized Turán numbers
• Stability in the Erdős-Gallai theorems on cycles and paths
• Stability results on the circumference of a graph
• The Turán number for spanning linear forests
• The formula for Turán number of spanning linear forests
• The generalized Turán number of linear forests
• The generalized Turán number of spanning linear forests
• The maximum number of $P_\ell$ copies in $P_k$-free graphs
• The maximum number of cliques in graphs without long cycles
• The maximum number of copies of \(K_{r,s}\) in graphs without long cycles or paths
• The maximum number of triangles in \(C_{2k+1}\)-free graphs
• The shifting method and generalized Turán number of matchings

Cited in

(7)

• Determinantal generating functions of colored spanning forests
• The generalized Turán number of linear forests
• A note on the stability results of the number of cliques in graphs with given matching number
• Stability of generalized Tur\'an number for linear forests
• Maximizing the number of cliques in graphs with given matching number
• Generalized Turán number of even linear forests
• The formula for Turán number of spanning linear forests

This page was built for publication: Further results on the generalized Turán number of spanning linear forests

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2107129)