Skip to main content
To refer to this page use: http://arks.princeton.edu/ark:/88435/pr1s96j
Full metadata record
DC FieldValueLanguage
dc.contributor.authorBerger, Eli-
dc.contributor.authorChoromanski, Krzysztof-
dc.contributor.authorChudnovsky, Maria-
dc.contributor.authorFox, Jacob-
dc.contributor.authorLoebl, Martin-
dc.contributor.authorScott, Alex-
dc.contributor.authorSeymour, Paul D.-
dc.contributor.authorThomassé, Stéphan-
dc.date.accessioned2018-07-20T15:09:04Z-
dc.date.available2018-07-20T15:09:04Z-
dc.date.issued2013-01en_US
dc.identifier.citationBerger, Eli, Choromanski, Krzysztof, Chudnovsky, Maria, Fox, Jacob, Loebl, Martin, Scott, Alex, Seymour, Paul, Thomasse, Stephan. (2013). Tournaments and colouring. JOURNAL OF COMBINATORIAL THEORY SERIES B, 103 (1 - 20. doi:10.1016/j.jctb.2012.08.003en_US
dc.identifier.issn0095-8956-
dc.identifier.urihttp://arks.princeton.edu/ark:/88435/pr1s96j-
dc.description.abstractA tournament is a complete graph with its edges directed, and colouring a tournament means partitioning its vertex set into transitive subtournaments. For some tournaments H there exists c such that every tournament not containing H as a subtournament has chromatic number at most c (we call such a tournament H a hero); for instance, all tournaments with at most four vertices are heroes. In this paper we explicitly describe all heroes. (C) 2012 Elsevier Inc. All rights reserved.en_US
dc.format.extent1 - 20en_US
dc.language.isoen_USen_US
dc.relation.ispartofJOURNAL OF COMBINATORIAL THEORY SERIES Ben_US
dc.rightsFinal published version. Article is made available in OAR by the publisher's permission or policy.en_US
dc.titleTournaments and colouringen_US
dc.typeJournal Articleen_US
dc.identifier.doidoi:10.1016/j.jctb.2012.08.003-
dc.date.eissued2012-08-29en_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 
1-s2.0-S0095895612000664-main.pdf291.52 kBAdobe PDFView/Download


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