Gerbner, Dániel (2025) Counting multiple graphs in generalized Turán problems. AUSTRALASIAN JOURNAL OF COMBINATORICS, 92 (3). pp. 244-265. ISSN 1034-4942
|
Text
2007.11645v2.pdf - Draft Version Download (256kB) | Preview |
Abstract
We are given graphs H1, …, Hk and F. Consider an F-free graph G on n vertices. What is the largest sum of the number of copies of Hi ? The case k = 1 has attracted a lot of attention. We also consider a colored variant, where the edges of G are colored with k colors. What is the largest sum of the number of copies of Hi in color i? Our motivation to study this colored variant is a recent result stating that the Turán number of the r-uniform Berge-F hypergraphs is at most the quantity defined above for k = 2, H1 = Kr and H2 = K2 . In addition to studying these new questions, we obtain new results for generalized Turán problems and also for Berge hypergraphs. © The author(s).
| Item Type: | Article |
|---|---|
| Subjects: | Q Science / természettudomány > QA Mathematics / matematika |
| SWORD Depositor: | MTMT SWORD |
| Depositing User: | MTMT SWORD |
| Date Deposited: | 05 Feb 2026 10:21 |
| Last Modified: | 05 Feb 2026 10:21 |
| URI: | https://real.mtak.hu/id/eprint/233368 |
Actions (login required)
 |
Edit Item |
