Back to Search
Start Over
Some results on k-Turán-good graphs.
- Source :
-
Discrete Mathematics . Sep2021, Vol. 344 Issue 9, pN.PAG-N.PAG. 1p. - Publication Year :
- 2021
-
Abstract
- For a graph H and a k -chromatic graph F , if the Turán graph T k − 1 (n) has the maximum number of copies of H among all n -vertex F -free graphs (for n large enough), then H is called F -Turán-good, or k -Turán-good for short if F is K k. In this paper, we construct some new classes of k -Turán-good graphs and prove that P 4 and P 5 are k -Turán-good for k ≥ 4. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 0012365X
- Volume :
- 344
- Issue :
- 9
- Database :
- Academic Search Index
- Journal :
- Discrete Mathematics
- Publication Type :
- Academic Journal
- Accession number :
- 151172227
- Full Text :
- https://doi.org/10.1016/j.disc.2021.112509