Gerbner, Dániel (2023) Generalized Turán problems for K2,t. ELECTRONIC JOURNAL OF COMBINATORICS, 30 (1). ISSN 1097-1440
|
Text
10588-PDFfile-43943-1-10-20230217.pdf Available under License Creative Commons Attribution. Download (342kB) | Preview |
Official URL: https://doi.org/10.37236/10588
Abstract
The generalized Turán function ex(n, H, F) denotes the largest number of copies of H among F-free n-vertex graphs. We study ex(n, H, F) when H or F is K2,t. We determine the order of magnitude of ex(n, H, K2,t) when H is a tree, and determine its asymptotics for a large class of trees. We also determine the asymptotics of ex(n, K2,t, F) when F has chromatic number at least three and when F is bipartite with one part of order at most two.
| Item Type: | Article |
|---|---|
| Additional Information: | Export Date: 14 March 2023 Correspondence Address: Gerbner, D.; Alfréd Rényi Institute of MathematicsHungary Funding details: Nemzeti Kutatási Fejlesztési és Innovációs Hivatal, NKFIH Funding details: National Research, Development and Innovation Office, FK 132060, KH 130371, KKP-133819, SNN 129364 Funding text 1: Funding: Research supported by the National Research, Development and Innovation Office - NKFIH under the grants KH 130371, SNN 129364, FK 132060, and KKP-133819. Funding text 2: Research supported by the National Research, Development and Innovation Office-NKFIH under the grants KH 130371, SNN 129364, FK 132060, and KKP133819. |
| Subjects: | Q Science / természettudomány > QA Mathematics / matematika |
| SWORD Depositor: | MTMT SWORD |
| Depositing User: | MTMT SWORD |
| Date Deposited: | 05 Apr 2024 11:42 |
| Last Modified: | 05 Apr 2024 11:42 |
| URI: | https://real.mtak.hu/id/eprint/191872 |
Actions (login required)
 |
Edit Item |
