The shifting method and generalized Turán number of matchings
Author:
- Jian WangJWJian Wang
- 1 March 2020
- journal article
- research article
- Published by Elsevier in European Journal of Combinatorics
- Vol. 85
Abstract
No abstract availableFunding Information
- Shanxi Province Science Foundation for Youths
- National Natural Science Foundation of China
This publication has 9 references indexed in Scilit:
- Some sharp results on the generalized Turán numbersEuropean Journal of Combinatorics, 2020
- Counting copies of a fixed subgraph in -free graphsEuropean Journal of Combinatorics, 2019
- Generalized Turán problems for disjoint copies of graphsDiscrete Mathematics, 2019
- 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
- On the maximum number of five-cycles in a triangle-free graphJournal of Combinatorial Theory, Series B, 2012
- On the size of graphs with complete‐factorsJournal of Graph Theory, 1985
- A method in graph theoryDiscrete Mathematics, 1976
- On maximal paths and circuits of graphsActa Mathematica Hungarica, 1959