




















We present new short proofs to both the exact and the stability results of two extremal problems. The first one is the extension of Turán's theorem in hypergraphs, which was firstly studied by Mubayi $\cite{MU06}$. The second one is about the cancellative hypergraphs, which was firstly studied by Bollobás $\cite{BO74}$ and later by Keevash and Mubayi $\cite{KM04}$. Our proofs are concise and straightforward, but give a sharper version of stability theorems to both problems.
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。