Exact generalized Turán numbers for even linear forests
From MaRDI portal
Publication:6542010
DOI10.1016/J.DISC.2024.113974zbMATH Open1540.05041MaRDI QIDQ6542010FDOQ6542010
Authors: Ya-Hong Chen, Jiabao Yang, Long-Tu Yuan, Ping Zhang
Publication date: 21 May 2024
Published in: Discrete Mathematics (Search for Journal in Brave)
Recommendations
Trees (05C05) Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10)
Cites Work
- On maximal paths and circuits of graphs
- Title not available (Why is that?)
- Many \(T\) copies in \(H\)-free graphs
- The maximum number of cliques in graphs without long cycles
- The Turán number of disjoint copies of paths
- Generalized Turán number of even linear forests
- Generalized Turán number for linear forests
- The shifting method and generalized Turán number of matchings
- Turán numbers for disjoint paths
- Exact results on generalized Erdős-Gallai problems
Cited In (1)
This page was built for publication: Exact generalized Turán numbers for even linear forests
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6542010)