### Abstract

Given a tournament score sequences_{1}≥s_{2}≥...≥s_{n}, we prove that there exists a tournamentTon vertex set (1, 2, ..., n) such that the degree of any vertexiiss_{i}and the subtournaments ofTon both the even and the odd vertices are transitive in the given order. This means thatibeatsjwheneveri<jandi≡j(mod2). For any score sequence, we give an algorithm to construct a tournament of the above form, i.e. it is transitive on evens and odds in the given order. This algorithm fixes half of the edges of the tournament and then is similar to the algorithm for constructing a tournament given its score sequence. Another consequence provides asymptotics for the maximum number of edges in score unavoidable digraphs. From a result of Ryser, it is possible to get from any tournament to this special tournament by a sequence of triangle reversals. We show thatn^{2}/2 reversals are always enough and that in some cases (1-o(1))n^{2}/32 are required. We also show that such a sequence of triangle reversals can be found inO(n^{2}) time.

Original language | English |
---|---|

Pages (from-to) | 181-196 |

Number of pages | 16 |

Journal | Journal of Combinatorial Theory. Series B |

Volume | 72 |

Issue number | 2 |

DOIs | |

Publication status | Published - márc. 1 1998 |

### ASJC Scopus subject areas

- Theoretical Computer Science
- Discrete Mathematics and Combinatorics
- Computational Theory and Mathematics

## Fingerprint Dive into the research topics of '2-Partition-Transitive Tournaments'. Together they form a unique fingerprint.

## Cite this

*Journal of Combinatorial Theory. Series B*,

*72*(2), 181-196. https://doi.org/10.1006/jctb.1997.1806