Some results and problems on tournament structure

From MaRDI portal
Publication:6439152

arXiv2306.02364MaRDI QIDQ6439152FDOQ6439152


Authors: Tung D. Nguyen, Alex Scott, Paul Seymour Edit this on Wikidata


Publication date: 4 June 2023

Abstract: This paper is a survey of results and problems related to the following question: is it true that if G is a tournament with sufficiently large chromatic number, then G has two vertex-disjoint subtournaments A,B, both with large chromatic number, such that all edges between them are directed from A to B? We describe what we know about this question, and report some progress on several other related questions, on tournament colouring and domination.













This page was built for publication: Some results and problems on tournament structure

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6439152)