Gerbner, Dániel and Tompkins, Casey and Zhou, Junpeng (2025) On hypergraph Turán problems with bounded matching number. EUROPEAN JOURNAL OF COMBINATORICS, 127. No. 104155. ISSN 0195-6698
|
Text
1-s2.0-S019566982500037X-main.pdf - Published Version Available under License Creative Commons Attribution. Download (483kB) | Preview |
Official URL: https://doi.org/10.1016/j.ejc.2025.104155
Abstract
Very recently, Alon and Frankl, and Gerbner studied the maximum number of edges in n-vertex F-free graphs with bounded matching number, respectively. We consider the analogous Turán problems on hypergraphs with bounded matching number, and we obtain some exact results. © 2025 The Author(s)
| Item Type: | Article |
|---|---|
| Additional Information: | Export Date: 04 April 2025; Cited By: 0; CODEN: EJOCD |
| Subjects: | Q Science / természettudomány > QA Mathematics / matematika |
| SWORD Depositor: | MTMT SWORD |
| Depositing User: | MTMT SWORD |
| Date Deposited: | 05 Feb 2026 10:38 |
| Last Modified: | 05 Feb 2026 10:38 |
| URI: | https://real.mtak.hu/id/eprint/233363 |
Actions (login required)
 |
Edit Item |
