Gerbner, Dániel (2024) On Turán problems with bounded matching number. JOURNAL OF GRAPH THEORY, First. ISSN 0364-9024
|
Text
2211.03272v1.pdf Download (111kB) | Preview |
Official URL: https://doi.org/10.1002/jgt.23067
Abstract
Very recently, Alon and Frankl initiated the study of the maximum number of edges in ‐vertex ‐free graphs with matching number at most . For fixed and , we determine this number apart from a constant additive term. We also obtain several exact results.
| Item Type: | Article |
|---|---|
| Additional Information: | Published online: 06 December 2023 Export Date: 14 February 2024 CODEN: JGTHD Correspondence Address: Gerbner, D.; Alfréd Rényi Institute of Mathematics, Hungary; email: gerbner.daniel@renyi.hu Funding details: Nemzeti Kutatási Fejlesztési és Innovációs Hivatal, NKFI, FK 132060, KKP‐133819, SNN 129364 Funding text 1: Research supported by the National Research, Development and Innovation Office—NKFIH under the grants SNN 129364, FK 132060, and KKP‐133819. |
| 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:08 |
| Last Modified: | 05 Apr 2024 11:08 |
| URI: | https://real.mtak.hu/id/eprint/191863 |
Actions (login required)
 |
Edit Item |
