Hypergraphs with infinitely many extremal constructions

DOI10.19086/DA.88508MaRDI QIDQ6962329zbMATH OpenFDO

Authors Jianfeng Hou, Heng Li, Xizhi Liu, Dhruv Mubayi, Yixiao Zhang

Publication date 8 July 2025

Published in Discrete Analysis (Search for Journal in Brave)

Full work available at URL https://doi.org/10.19086/DA.88508

zbMATH Keywords

feasible regionhypergraph Turán problemLagrangianmultilinear polynomialsnonminimal hypergraphsshadowstability

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Extremal problems in graph theory (05C35) Hypergraphs (05C65) Structural characterization of families of graphs (05C75) Extremal combinatorics (05D99)

Cited in

(6)

• Non-degenerate hypergraphs with exponentially many extremal constructions
• Two stability theorems for \(\mathcal{K}_{\ell + 1}^r\)-saturated hypergraphs
• Toward a density Corrádi-Hajnal theorem for degenerate hypergraphs
• Finite hypergraph families with rich extremal Turán constructions via mixing patterns
• Hypergraphs with many extremal configurations
• A criterion for Andrásfai-Erdős-Sós type theorems and applications

This page was built for publication: Hypergraphs with infinitely many extremal constructions

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