Almost all cancellative triple systems are tripartite

Details Almost all cancellative triple systems are tripartite Almost all cancellative triple systems are tripartite

2009-10-15

arxiv.org/abs/0910.2941v1

Mathematics

Combinatorics

Scientific paper

A triple system is cancellative if no three of its distinct edges satisfy $A \cup B=A \cup C$. It is tripartite if it has a vertex partition into three parts such that every edge has exactly one point in each part. It is easy to see that every tripartite triple system is cancellative. We prove that almost all cancellative triple systems with vertex set [n] are tripartite. This sharpens a theorem of Nagle and Rodl on the number of cancellative triple systems. It also extends recent work of Person and Schacht who proved a similar result for triple systems without the Fano configuration. Our proof uses the hypergraph regularity lemma of Frankl and Rodl, and a stability theorem for cancellative triple systems due to Keevash and the second author.

Affiliated with

Also associated with

No associations

Rating

Almost all cancellative triple systems are tripartite does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Almost all cancellative triple systems are tripartite, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Almost all cancellative triple systems are tripartite will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-620554