The number of edge-disjoint transitive triples in a tournament

Raphael Yuster

doi:10.1016/j.disc.2004.07.005

The number of edge-disjoint transitive triples in a tournament

Raphael Yuster

Department of Mathematics

Research output: Contribution to journal › Article › peer-review

Abstract

We prove that a tournament with n vertices has more than 0.13n² (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.

Original language	English
Pages (from-to)	187-191
Number of pages	5
Journal	Discrete Mathematics
Volume	287
Issue number	1-3
DOIs	https://doi.org/10.1016/j.disc.2004.07.005
State	Published - 28 Oct 2004

Keywords

Tournament
Transitive
Triple

ASJC Scopus subject areas

Theoretical Computer Science
Discrete Mathematics and Combinatorics

Access to Document

10.1016/j.disc.2004.07.005

Cite this

@article{20de45c842c34c469301a625c88aa353,

title = "The number of edge-disjoint transitive triples in a tournament",

abstract = "We prove that a tournament with n vertices has more than 0.13n2 (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{\"o}dl.",

keywords = "Tournament, Transitive, Triple",

author = "Raphael Yuster",

year = "2004",

month = oct,

day = "28",

doi = "10.1016/j.disc.2004.07.005",

language = "English",

volume = "287",

pages = "187--191",

journal = "Discrete Mathematics",

issn = "0012-365X",

publisher = "Elsevier",

number = "1-3",

}

TY - JOUR

T1 - The number of edge-disjoint transitive triples in a tournament

AU - Yuster, Raphael

PY - 2004/10/28

Y1 - 2004/10/28

N2 - We prove that a tournament with n vertices has more than 0.13n2 (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.

AB - We prove that a tournament with n vertices has more than 0.13n2 (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.

KW - Tournament

KW - Transitive

KW - Triple

UR - http://www.scopus.com/inward/record.url?scp=4644296066&partnerID=8YFLogxK

U2 - 10.1016/j.disc.2004.07.005

DO - 10.1016/j.disc.2004.07.005

M3 - Article

AN - SCOPUS:4644296066

SN - 0012-365X

VL - 287

SP - 187

EP - 191

JO - Discrete Mathematics

JF - Discrete Mathematics

IS - 1-3

ER -

The number of edge-disjoint transitive triples in a tournament

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this