Gerbner, Dániel (2023) Generalized Turán Problems for Small Graphs. DISCUSSIONES MATHEMATICAE GRAPH THEORY, 43 (2). pp. 549-572. ISSN 1234-3099
|
Text
2006.16150v1.pdf Available under License Creative Commons Attribution. Download (266kB) | Preview |
Official URL: https://doi.org/10.7151/dmgt.2388
Abstract
For graphs H and F , the generalized Turán number ex(n, H, F ) is the largest number of copies of H in an F -free graph on n vertices. We consider this problem when both H and F have at most four vertices. We give sharp results in almost all cases, and connect the remaining cases to well-known unsolved problems. Our main new contribution is applying the progressive induction method of Simonovits for generalized Turán problems.
Item Type: | Article |
---|---|
Uncontrolled Keywords: | Extremal; generalized Turan problem; |
Subjects: | Q Science / természettudomány > QA Mathematics / matematika |
SWORD Depositor: | MTMT SWORD |
Depositing User: | MTMT SWORD |
Date Deposited: | 05 Apr 2024 10:18 |
Last Modified: | 05 Apr 2024 10:18 |
URI: | https://real.mtak.hu/id/eprint/191889 |
Actions (login required)
![]() |
Edit Item |