On the order of intersecting hypergraphs

DOI10.1137/25M1759045MaRDI QIDQ7316751zbMATH OpenFDO

Authors Stijn Cambie, Jaehoon Kim, Hyun Woo Lee, Hong Liu, Tuan Anh Tran

Publication date 20 August 2026

Published in SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/25M1759045

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Hypergraphs (05C65) Extremal set theory (05D05)

Cites work

• A pushing-pulling method: New proofs of intersection theorems
• scientific article; zbMATH DE number 3492718 (Why is no real title available?)
• scientific article; zbMATH DE number 3621717 (Why is no real title available?)
• scientific article; zbMATH DE number 1355280 (Why is no real title available?)
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• Maximum degree and fractional matchings in uniform hypergraphs
• On a conjecture of Frankl and Füredi
• On generalized graphs
• On the maximum number of points in a maximal intersecting family of finite sets
• On the structure of regular pairwise balanced designs
• On two conjectures of Stanton and Mullin
• Problems and results on 1-cross-intersecting set pair systems
• The complete intersection theorem for systems of finite sets
• The exact bound in the Erdős-Ko-Rado theorem

This page was built for publication: On the order of intersecting hypergraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7316751)