Decomposing oriented graphs into transitive tournaments

Raphael Yuster

doi:10.1016/j.disc.2005.11.008

Decomposing oriented graphs into transitive tournaments

Raphael Yuster

Department of Mathematics

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

Abstract

For an oriented graph G with n vertices, let f(G) denote the minimum number of transitive subtournaments that decompose G. We prove several results on f(G). In particular, if G is a tournament then f(G)<521n2(1+o(1)) and there are tournaments for which f(G)>n2/3000. For general G we prove that f(G)≤⌊n2/3⌋ and this is tight. Some related parameters are also considered.

Original language	English
Pages (from-to)	166-170
Number of pages	5
Journal	Discrete Mathematics
Volume	306
Issue number	1
DOIs	https://doi.org/10.1016/j.disc.2005.11.008
State	Published - 28 Jan 2006

Keywords

Decomposition
Tournament
Transitive

ASJC Scopus subject areas

Theoretical Computer Science
Discrete Mathematics and Combinatorics

Access to Document

10.1016/j.disc.2005.11.008

Cite this

@article{e044150cfc7747dd9871282c6726e117,

title = "Decomposing oriented graphs into transitive tournaments",

abstract = "For an oriented graph G with n vertices, let f(G) denote the minimum number of transitive subtournaments that decompose G. We prove several results on f(G). In particular, if G is a tournament then f(G)<521n2(1+o(1)) and there are tournaments for which f(G)>n2/3000. For general G we prove that f(G)≤⌊n2/3⌋ and this is tight. Some related parameters are also considered.",

keywords = "Decomposition, Tournament, Transitive",

author = "Raphael Yuster",

year = "2006",

month = jan,

day = "28",

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

language = "English",

volume = "306",

pages = "166--170",

journal = "Discrete Mathematics",

issn = "0012-365X",

publisher = "Elsevier",

number = "1",

}

TY - JOUR

T1 - Decomposing oriented graphs into transitive tournaments

AU - Yuster, Raphael

PY - 2006/1/28

Y1 - 2006/1/28

N2 - For an oriented graph G with n vertices, let f(G) denote the minimum number of transitive subtournaments that decompose G. We prove several results on f(G). In particular, if G is a tournament then f(G)<521n2(1+o(1)) and there are tournaments for which f(G)>n2/3000. For general G we prove that f(G)≤⌊n2/3⌋ and this is tight. Some related parameters are also considered.

AB - For an oriented graph G with n vertices, let f(G) denote the minimum number of transitive subtournaments that decompose G. We prove several results on f(G). In particular, if G is a tournament then f(G)<521n2(1+o(1)) and there are tournaments for which f(G)>n2/3000. For general G we prove that f(G)≤⌊n2/3⌋ and this is tight. Some related parameters are also considered.

KW - Decomposition

KW - Tournament

KW - Transitive

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

U2 - 10.1016/j.disc.2005.11.008

DO - 10.1016/j.disc.2005.11.008

M3 - Article

AN - SCOPUS:31344442330

SN - 0012-365X

VL - 306

SP - 166

EP - 170

JO - Discrete Mathematics

JF - Discrete Mathematics

IS - 1

ER -

Decomposing oriented graphs into transitive tournaments

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this