Lv, Zequn and Győri, Ervin and He, Zhen and Salia, Nika and Tompkins, Casey and Varga, Kitti Katalin and Zhu, Xiutao (2024) Generalized Turán numbers for the edge blow-up of a graph. DISCRETE MATHEMATICS, 347 (1). ISSN 0012-365X
|
Text
2210.11914v1.pdf Download (132kB) | Preview |
Official URL: https://doi.org/10.1016/j.disc.2023.113682
Abstract
Let H be a graph and p be an integer. The edge blow-up Hp of H is the graph obtained from replacing each edge in H by a copy of Kp where the new vertices of the cliques are all distinct. Let Ck and Pk denote the cycle and path with k vertices, respectively. In this paper, we find sharp upper bounds for ex(n, K3, C33) and the exact value for ex(n, K3, P43). Moreover, we determine the graphs attaining these bounds.(c) 2023 Elsevier B.V. All rights reserved.
| Item Type: | Article |
|---|---|
| Additional Information: | Funding Agency and Grant Number: National Research, Development and Innovation Office NKFIH [K132696, SNN-135643]; Institute for Basic Science [IBS-R029-C4]; NKFIH grant [K135800] Funding text: The research of the authors Gyori and Salia was partially supported by the National Research, Development and Innovation Office NKFIH, grants K132696 and SNN-135643. The research of Salia was supported by the Institute for Basic Science (IBS-R029-C4) . The research of Tompkins was supported by NKFIH grant K135800. |
| Uncontrolled Keywords: | Turán number; Blow-up graph; |
| Subjects: | Q Science / természettudomány > QA Mathematics / matematika |
| SWORD Depositor: | MTMT SWORD |
| Depositing User: | MTMT SWORD |
| Date Deposited: | 30 Mar 2024 11:46 |
| Last Modified: | 30 Mar 2024 11:46 |
| URI: | https://real.mtak.hu/id/eprint/191303 |
Actions (login required)
 |
Edit Item |
