Tournament minors

Ilhee Kim, Paul Seymour

Research output: Contribution to journalArticle

13 Scopus citations

Abstract

We say a digraph G is a minor of a digraph H if G can be obtained from a subdigraph of H by repeatedly contracting a strongly-connected subdigraph to a vertex. Here, we show that the class of all tournaments is a well-quasi-order under minor containment.

Original languageEnglish (US)
Pages (from-to)138-153
Number of pages16
JournalJournal of Combinatorial Theory. Series B
Volume112
DOIs
StatePublished - May 1 2015

All Science Journal Classification (ASJC) codes

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

Keywords

  • Digraph
  • Minor
  • Tournament
  • Well-quasi-order

Fingerprint Dive into the research topics of 'Tournament minors'. Together they form a unique fingerprint.

  • Cite this