2-Partition-Transitive Tournaments

Barry Guiduli, A. Gyárfás, Stéphan Thomassé, Peter Weidl

Research output: Contribution to journalArticle

7 Citations (Scopus)

Abstract

Given a tournament score sequences1≥s2≥...≥sn, we prove that there exists a tournamentTon vertex set (1, 2, ..., n) such that the degree of any vertexiissiand the subtournaments ofTon both the even and the odd vertices are transitive in the given order. This means thatibeatsjwheneveri2/2 reversals are always enough and that in some cases (1-o(1))n2/32 are required. We also show that such a sequence of triangle reversals can be found inO(n2) time.

Original languageEnglish
Pages (from-to)181-196
Number of pages16
JournalJournal of Combinatorial Theory. Series B
Volume72
Issue number2
DOIs
Publication statusPublished - Mar 1998

Fingerprint

Tournament
Reversal
Partition
Triangle
Odd
Vertex of a graph

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Theoretical Computer Science

Cite this

2-Partition-Transitive Tournaments. / Guiduli, Barry; Gyárfás, A.; Thomassé, Stéphan; Weidl, Peter.

In: Journal of Combinatorial Theory. Series B, Vol. 72, No. 2, 03.1998, p. 181-196.

Research output: Contribution to journalArticle

Guiduli, Barry ; Gyárfás, A. ; Thomassé, Stéphan ; Weidl, Peter. / 2-Partition-Transitive Tournaments. In: Journal of Combinatorial Theory. Series B. 1998 ; Vol. 72, No. 2. pp. 181-196.
@article{02580e65b56a444ca7ce4f9cbcc29f55,
title = "2-Partition-Transitive Tournaments",
abstract = "Given a tournament score sequences1≥s2≥...≥sn, we prove that there exists a tournamentTon vertex set (1, 2, ..., n) such that the degree of any vertexiissiand the subtournaments ofTon both the even and the odd vertices are transitive in the given order. This means thatibeatsjwheneveri2/2 reversals are always enough and that in some cases (1-o(1))n2/32 are required. We also show that such a sequence of triangle reversals can be found inO(n2) time.",
author = "Barry Guiduli and A. Gy{\'a}rf{\'a}s and St{\'e}phan Thomass{\'e} and Peter Weidl",
year = "1998",
month = "3",
doi = "10.1006/jctb.1997.1806",
language = "English",
volume = "72",
pages = "181--196",
journal = "Journal of Combinatorial Theory. Series B",
issn = "0095-8956",
publisher = "Academic Press Inc.",
number = "2",

}

TY - JOUR

T1 - 2-Partition-Transitive Tournaments

AU - Guiduli, Barry

AU - Gyárfás, A.

AU - Thomassé, Stéphan

AU - Weidl, Peter

PY - 1998/3

Y1 - 1998/3

N2 - Given a tournament score sequences1≥s2≥...≥sn, we prove that there exists a tournamentTon vertex set (1, 2, ..., n) such that the degree of any vertexiissiand the subtournaments ofTon both the even and the odd vertices are transitive in the given order. This means thatibeatsjwheneveri2/2 reversals are always enough and that in some cases (1-o(1))n2/32 are required. We also show that such a sequence of triangle reversals can be found inO(n2) time.

AB - Given a tournament score sequences1≥s2≥...≥sn, we prove that there exists a tournamentTon vertex set (1, 2, ..., n) such that the degree of any vertexiissiand the subtournaments ofTon both the even and the odd vertices are transitive in the given order. This means thatibeatsjwheneveri2/2 reversals are always enough and that in some cases (1-o(1))n2/32 are required. We also show that such a sequence of triangle reversals can be found inO(n2) time.

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

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

U2 - 10.1006/jctb.1997.1806

DO - 10.1006/jctb.1997.1806

M3 - Article

AN - SCOPUS:0039657369

VL - 72

SP - 181

EP - 196

JO - Journal of Combinatorial Theory. Series B

JF - Journal of Combinatorial Theory. Series B

SN - 0095-8956

IS - 2

ER -