Gerbner, Dániel and Methuku, Abhishek and Vizer, Máté (2019) Generalized Turán problems for disjoint copies of a graph. Discrete Mathematics, 342 (11). pp. 3130-3141.
|
Text
1712.07072.pdf Download (211kB) | Preview |
Abstract
Given two graphs H and F, the maximum possible number of copies of H in an F-free graph on n vertices is denoted by ex(n, H, F). We investigate the function ex(n, H, kF), where kF denotes k vertex disjoint copies of a fixed graph F. Our results include cases when F is a complete graph, cycle or a complete bipartite graph.
| Item Type: | Article |
|---|---|
| Subjects: | Q Science / természettudomány > QA Mathematics / matematika |
| Depositing User: | Dániel Gerbner |
| Date Deposited: | 25 Sep 2019 14:25 |
| Last Modified: | 25 Sep 2019 14:25 |
| URI: | http://real.mtak.hu/id/eprint/101404 |
Actions (login required)
 |
Edit Item |
