Stability theorems for cancellative hypergraphs

  • Keevash P
  • Mubayi D
  • 4


    Mendeley users who have this article in their library.
  • 28


    Citations of this article.


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 F5 is 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.

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document


Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free