The number of edge disjoint transitive triples in a tournament

Details The number of edge disjoint transitive triples in a tournament The number of edge disjoint transitive triples in a tournament

2003-04-14

arxiv.org/abs/math/0304180v1

Mathematics

Combinatorics

7 pages

Scientific paper

We prove that a tournament with $n$ vertices has more than $0.13n^2(1+o(1))$
edge-disjoint transitive triples. We also prove some results on the existence
of large packings of $k$-vertex transitive tournaments in an $n$-vertex
tournament. Our proofs combine probabilistic arguments and some powerful
packing results due to Wilson and to Frankl and R\"odl.

Affiliated with

Also associated with

No associations

Rating

The number of edge disjoint transitive triples in a tournament 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 The number of edge disjoint transitive triples in a tournament, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The number of edge disjoint transitive triples in a tournament will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-548081