Further results on the generalized Turán number of spanning linear forests
From MaRDI portal
Publication:2107129
DOI10.1007/S40840-022-01412-YzbMATH Open1504.05142OpenAlexW4309907337MaRDI QIDQ2107129FDOQ2107129
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
Recommendations
Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30) Paths and cycles (05C38)
Cites Work
- On maximal paths and circuits of graphs
- Title not available (Why is that?)
- A method in graph theory
- Stability in the Erdős-Gallai theorems on cycles and paths
- Title not available (Why is that?)
- The maximum number of triangles in \(C_{2k+1}\)-free graphs
- Many \(T\) copies in \(H\)-free graphs
- The maximum number of cliques in graphs without long cycles
- Extensions of a theorem of Erdős on nonhamiltonian graphs
- Extensions of the Erdős–Gallai theorem and Luo’s theorem
- Stability results on the circumference of a graph
- The Turán number for spanning linear forests
- The generalized Turán number of spanning linear forests
- Title not available (Why is that?)
- Generalized Turán problems for disjoint copies of graphs
- Maximizing the number of cliques in graphs with given matching number
- Generalized Turán problems for even cycles
- Some sharp results on the generalized Turán numbers
- The maximum number of $P_\ell$ copies in $P_k$-free graphs
- The formula for Turán number of spanning linear forests
- The shifting method and generalized Turán number of matchings
- The maximum number of copies of \(K_{r,s}\) in graphs without long cycles or paths
Cited In (3)
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)
