Toward a density Corr\'{a}di--Hajnal theorem for degenerate hypergraphs
Jianfeng Hou, Caiyun Hu, Heng Li, Xizhi Liu, Caihong Yang, and Yixiao, Zhang

TL;DR
This paper investigates the maximum number of edges in large hypergraphs with limited disjoint copies of a degenerate hypergraph, revealing different extremal structures across various density intervals.
Contribution
It provides near-optimal upper bounds for degenerate hypergraphs' extremal functions in multiple density regimes, extending and complementing prior nondegenerate hypergraph results.
Findings
Different extremal structures identified across three density intervals.
Characterizations of extremal constructions within the first and second intervals.
Proof techniques applicable to certain nondegenerate hypergraphs, including those with unknown Turán densities.
Abstract
Given an -graph with , let denote the maximum number of edges in an -vertex -graph with at most pairwise vertex-disjoint copies of . Extending several old results and complementing prior work [J. Hou, H. Li, X. Liu, L.-T. Yuan, and Y. Zhang. A step towards a general density Corr\'{a}di--Hajnal theorem. arXiv:2302.09849, 2023.] on nondegenerate hypergraphs, we initiate a systematic study on for degenerate hypergraphs . For a broad class of degenerate hypergraphs , we present near-optimal upper bounds for when is sufficiently large and lies in intervals , , and , where…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsLimits and Structures in Graph Theory · Graph theory and applications · Advanced Graph Theory Research
