Stability theorems for cancellative hypergraphs

Citations of this article
Mendeley users who have this article in their library.
Get full text


A cancellative hypergraph has no three edges A,B,C with AΔB⊂C. We give a new short proof of an old result of Bollobás, which states that the maximum size of a cancellative triple system is achieved by the balanced complete tripartite 3-graph. One of the two forbidden subhypergraphs in a cancellative 3-graph is F5={abc,abd,cde}. For n≥33 we show that the maximum number of triples on n vertices containing no copy of F5is also achieved by the balanced complete tripartite 3-graph. This strengthens a theorem of Frankl and Füredi, who proved it for n≥3000.For both extremal results, we show that a 3-graph with almost as many edges as the extremal example is approximately tripartite. These stability theorems are analogous to the Simonovits stability theorem for graphs. © 2004 Elsevier Inc.




Keevash, P., & Mubayi, D. (2004). Stability theorems for cancellative hypergraphs. Journal of Combinatorial Theory. Series B, 92(1), 163–175.

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free