Zhang, Fangfang and Chen, Yaojun and Győri, Ervin and Zhu, Xiutao (2024) Maximum cliques in a graph without disjoint given subgraph. DISCRETE MATHEMATICS, 347 (4). ISSN 0012-365X
|
Text
2309.09603v1.pdf Download (129kB) | Preview |
Official URL: https://doi.org/10.1016/j.disc.2023.113863
Abstract
The generalized Turan number ex(n, Ks, F) denotes the maximum number of copies of Ks in an n -vertex F -free graph. Let kF denote k disjoint copies of F. Gerbner et al. (2019) [8] gave a lower bound for ex(n, K3, 2C5) and obtained the magnitude of ex(n, Ks, kKr). In this paper, we determine the exact value of ex(n, K3, 2C5) and described the unique extremal graph for large n. Moreover, we also determine the exact value of ex(n, Kr, (k + 1)Kr) which generalizes some known results.
| Item Type: | Article |
|---|---|
| Additional Information: | School of Applied Mathematics, Nanjing University of Finance and Economics, Nanjing, 210023, China Department of Mathematics, Nanjing University, China Alfréd Rényi Institute of Mathematics, HUN-REN, Hungary School of Mathematics, Nanjing University of Aeronautics and Astronautics, China Key Laboratory of Mathematical Modelling and High Performance Computing of Air Vehicles (NUAA), MIIT, Nanjing, 211106, China Export Date: 20 February 2024 CODEN: DSMHA Correspondence Address: Zhu, X.; School of Mathematics, China; email: zhuxt@smail.nju.edu.cn Funding details: National Natural Science Foundation of China, NSFC, 11931006, 12101298, 12161141003 Funding details: National Research, Development and Innovation Office, K132696, SNN-135643 Funding text 1: The research of the author Győri is partially supported by the National Research, Development and Innovation Office NKFIH, grants K132696 , and SNN-135643 , Chen is supported by NSFC under grant numbers 12161141003 and 11931006 , Zhang is supported by NSFC under grant numbers 12101298 . |
| Uncontrolled Keywords: | Extremal graph; Disjoint union; Generalized Turán number; |
| Subjects: | Q Science / természettudomány > QA Mathematics / matematika > QA166-QA166.245 Graphs theory / gráfelmélet |
| SWORD Depositor: | MTMT SWORD |
| Depositing User: | MTMT SWORD |
| Date Deposited: | 05 Apr 2024 11:16 |
| Last Modified: | 05 Apr 2024 11:16 |
| URI: | https://real.mtak.hu/id/eprint/191866 |
Actions (login required)
 |
Edit Item |
