2019/03/05 by Xizhi Liu, Liu, Xizhi
Computer Science · Mathematics · #Advanced Graph Theory Research #Combinatorics (math.CO) #FOS: Mathematics #Graph theory and applications #Limits and Structures in Graph Theory
paper · pdf · doi:10.48550/arxiv.1903.01606
openalex publication_date 2019/03/05 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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 \citeMU06. The second one is about the cancellative hypergraphs, which was firstly studied by Bollobás \citeBO74 and later by Keevash and Mubayi \citeKM04. Our proofs are concise and straightforward, but give a sharper version of stability theorems to both problems.