Almost all triple systems with independent neighborhoods are semi-bipartite

Details Almost all triple systems with independent neighborhoods are semi-bipartite Almost all triple systems with independent neighborhoods are semi-bipartite

2010-02-09

arxiv.org/abs/1002.1925v1

Mathematics

Combinatorics

Scientific paper

The neighborhood of a pair of vertices $u,v$ in a triple system is the set of vertices $w$ such that $uvw$ is an edge. A triple system $\HH$ is semi-bipartite if its vertex set contains a vertex subset $X$ such that every edge of $\HH$ intersects $X$ in exactly two points. It is easy to see that if $\HH$ is semi-bipartite, then the neighborhood of every pair of vertices in $\HH$ is an independent set. We show a partial converse of this statement by proving that almost all triple systems with vertex sets $[n]$ and independent neighborhoods are semi-bipartite. Our result can be viewed as an extension of the Erd\H os-Kleitman-Rothschild theorem to triple systems. The proof uses the Frankl-R\"odl hypergraph regularity lemma, and stability theorems. Similar results have recently been proved for hypergraphs with various other local constraints.

Affiliated with

Also associated with

No associations

Rating

Almost all triple systems with independent neighborhoods are semi-bipartite 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 triple systems with independent neighborhoods are semi-bipartite, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Almost all triple systems with independent neighborhoods are semi-bipartite will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-125178