Journal article
Some results and problems on tournament structure
- 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.
- Publication status:
- Published
- Peer review status:
- Peer reviewed
Actions
Access Document
- Files:
-
-
(Preview, Accepted manuscript, pdf, 366.5KB, Terms of use)
-
- Publisher copy:
- 10.1016/j.jctb.2025.02.002
Authors
+ Engineering and Physical Sciences Research Council
More from this funder
- Funder identifier:
- https://ror.org/0439y7842
- Grant:
- EP/X013642/1
- Publisher:
- Elsevier
- Journal:
- Journal of Combinatorial Theory, Series B More from this journal
- Volume:
- 173
- Pages:
- 146-183
- Publication date:
- 2025-02-28
- Acceptance date:
- 2025-01-23
- DOI:
- EISSN:
-
1096-0902
- ISSN:
-
0095-8956
- Language:
-
English
- Keywords:
- Pubs id:
-
2083031
- Local pid:
-
pubs:2083031
- Deposit date:
-
2025-02-03
Terms of use
- Copyright date:
- 2025
- Rights statement:
- © 2025 Published by Elsevier Inc
- Notes:
-
The author accepted manuscript (AAM) of this paper has been made available under the University of Oxford's Open Access Publications Policy, and a CC BY public copyright licence has been applied.
This is the accepted manuscript version of the article. The final version is available online from Elsevier at https://dx.doi.org/10.1016/j.jctb.2025.02.002
- Licence:
- CC Attribution (CC BY)
If you are the owner of this record, you can report an update to it here: Report update to this record