The Generalized Turán Number of Spanning Linear Forests
- 1 February 2022
- journal article
- research article
- Published by Springer Nature in Graphs and Combinatorics
- Vol. 38 (2) , 1-17
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- National Natural Science Foundation of China (11871398)
- the Seed Foundation of Innovation and Creation for Graduate Students in Northwestern Polytechnical University (CX2020190)
This publication has 15 references indexed in Scilit:
- Counting copies of a fixed subgraph in -free graphsEuropean Journal of Combinatorics, 2019
- Generalized Turán problems for disjoint copies of graphsDiscrete Mathematics, 2019
- Planar Turán Numbers of Short PathsGraphs and Combinatorics, 2019
- A Generalized Turán Problem and its ApplicationsInternational Mathematics Research Notices, 2018
- The maximum number of cliques in graphs without long cyclesJournal of Combinatorial Theory, Series B, 2018
- Many T copies in H-free graphsJournal of Combinatorial Theory, Series B, 2016
- The History of Degenerate (Bipartite) Extremal Graph Problems2013
- The Maximum Number of Triangles in C2k+1-Free GraphsCombinatorics, Probability and Computing, 2012
- On graphs with randomly deleted edgesActa Mathematica Hungarica, 1981
- On maximal paths and circuits of graphsActa Mathematica Hungarica, 1959