Nguyen–Scott–Seymour cyclic-triangle conjecture
There exists an integer such that, for every tournament and every pair of disjoint vertex subsets with and , there are subsets and such that , both and are cyclic triangles, and either every edge between and is directed from to , or every edge between and is directed from to .
References
- High-chromatic tournament parts without a complete pair of cyclic triangles — arXiv — Guantao Chen, Hein van der Holst, Shengze Wang
Source: arXiv
Progress summary
A new unrefereed preprint claims to disprove the conjecture, but the construction has not been independently assessed.
The conjecture of Nguyen, Scott, and Seymour asserts that two disjoint sufficiently high-chromatic parts of a tournament must contain cyclic triangles forming a complete pair.
October 2026 counterexample
Chen, van der Holst, and Wang claim that, for every positive integer , they construct a tournament with two parts of chromatic number at least but with no such pair of cyclic triangles. This would disprove the conjecture. The result is presented in an unrefereed preprint.
Current status (as of October 2026): The conjecture was previously recorded as open, but a 2026 preprint claims a counterexample; that claim remains unverified.
Solutions 0
No solutions have been posted yet.