New Short Proofs to Some Stability Theorems
Combinatorics
2019-04-03 v2
Abstract
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\'{a}n's theorem in hypergraphs, which was firstly studied by Mubayi . The second one is about the cancellative hypergraphs, which was firstly studied by Bollob\'{a}s and later by Keevash and Mubayi . Our proofs are concise and straightforward, but give a sharper version of stability theorems to both problems.
Keywords
Cite
@article{arxiv.1903.01606,
title = {New Short Proofs to Some Stability Theorems},
author = {Xizhi Liu},
journal= {arXiv preprint arXiv:1903.01606},
year = {2019}
}
Comments
8 pages. Comments are welcome! A new reference of Contiero and Hoppen and et al is added. The dependence of epsilon and delta in Theorem 1.4 is improved to linear, and epsilon was the forth power of delta in a previous version. A brief discussion of the relation between epsilon and delta is also added