The number of edge disjoint transitive triples in a tournament
| dc.creator | Yuster, Raphael | |
| dc.date | 2003-04-14 | |
| dc.date.accessioned | 2026-07-07T04:56:51Z | |
| dc.date.available | 2026-07-07T04:56:51Z | |
| dc.description | 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ödl. | |
| dc.description | 7 pages | |
| dc.identifier | https://arxiv.org/abs/math/0304180 | |
| dc.identifier | http://arxiv.org/abs/math/0304180 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/67072 | |
| dc.subject | Combinatorics | |
| dc.subject | 05C20; 05C70 | |
| dc.title | The number of edge disjoint transitive triples in a tournament | |
| dc.type | text |