Gerbner, Dániel (2024) A Non-aligning Variant of Generalized Turán Problems. ANNALS OF COMBINATORICS. ISSN 0218-0006
|
Text
s00026-023-00640-8.pdf Download (361kB) | Preview |
Abstract
In the so-called generalized Turán problems we study the largest number of copies of H in an n -vertex F -free graph G . Here we introduce a variant, where F is not forbidden, but we restrict how copies of H and F can be placed in G . More precisely, given an integer n and graphs H and F , what is the largest number of copies of H in an n -vertex graph such that the vertex set of that copy does not contain and is not contained in the vertex set of a copy of F ? We solve this problem for some instances, give bounds in other instances, and we use our results to determine the generalized Turán number for some pairs of graphs.
| Item Type: | Article |
|---|---|
| Additional Information: | Published online: 25 February 2023 Correspondence Address: Gerbner, D.; Alfréd Rényi Institute of MathematicsHungary; email: gerbner.daniel@renyi.hu Funding details: Nemzeti Kutatási Fejlesztési és Innovációs Hivatal, NKFIH, FK 132060, KH130371, KKP-133819, SNN 129364 Funding text 1: Open access funding provided by ELKH Alfréd Rényi Institute of Mathematics Research supported by the National Research, Development and Innovation Office—NKFIH under the Grants SNN 129364, FK 132060, and KKP-133819. Funding text 2: Research supported by the National Research, Development and Innovation Office – NKFIH under the Grants FK 132060, KKP-133819, KH130371 and SNN 129364. |
| Subjects: | Q Science / természettudomány > QA Mathematics / matematika |
| SWORD Depositor: | MTMT SWORD |
| Depositing User: | MTMT SWORD |
| Date Deposited: | 05 Apr 2024 11:45 |
| Last Modified: | 05 Apr 2024 11:45 |
| URI: | https://real.mtak.hu/id/eprint/191878 |
Actions (login required)
 |
Edit Item |
