Skip to main content

Tournament minors

Author(s): Kim, Ilhee; Seymour, Paul D.

Download
To refer to this page use: http://arks.princeton.edu/ark:/88435/pr1gd6k
Full metadata record
DC FieldValueLanguage
dc.contributor.authorKim, Ilhee-
dc.contributor.authorSeymour, Paul D.-
dc.date.accessioned2018-07-20T15:11:19Z-
dc.date.available2018-07-20T15:11:19Z-
dc.date.issued2015-05en_US
dc.identifier.citationKim, Ilhee, Seymour, Paul. (2015). Tournament minors. JOURNAL OF COMBINATORIAL THEORY SERIES B, 112 (138 - 153. doi:10.1016/j.jctb.2014.12.005en_US
dc.identifier.issn0095-8956-
dc.identifier.urihttp://arks.princeton.edu/ark:/88435/pr1gd6k-
dc.description.abstractWe 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. (C) 2014 Elsevier Inc. All rights reserved.en_US
dc.format.extent138 - 153en_US
dc.language.isoen_USen_US
dc.relation.ispartofJOURNAL OF COMBINATORIAL THEORY SERIES Ben_US
dc.rightsAuthor's manuscripten_US
dc.titleTournament minorsen_US
dc.typeJournal Articleen_US
dc.identifier.doidoi:10.1016/j.jctb.2014.12.005-
dc.date.eissued2014-12-30en_US
dc.identifier.eissn1096-0902-
pu.type.symplectichttp://www.symplectic.co.uk/publications/atom-terms/1.0/journal-articleen_US

Files in This Item:
File Description SizeFormat 
1206.3135.pdf316.43 kBAdobe PDFView/Download


Items in OAR@Princeton are protected by copyright, with all rights reserved, unless otherwise indicated.