3 papers
math.CO2026
High-chromatic tournament parts without a complete pair of cyclic triangles
Guantao Chen, Hein van der Holst, Shengze Wang
Nguyen, Scott, and Seymour conjectured that any two disjoint subtournaments of sufficiently large chromatic number contain cyclic triangles, one in each subtournament, with all edg…
math.CO2026
Cayley Tournaments Simultaneously Critical for the Clique and Dichromatic Numbers
Guantao Chen, Shengze Wang
For a tournament , let be the minimum clique number among the backedge graphs of , and let be its dichromatic number. We give a template-lifting construction. I…
math.CO2026
Average degrees of edge--critical multigraphs
Guantao Chen, Yuying Ma, Yimo Su +1
Let be a loopless multigraph with maximum degree , average degree , density , and chromatic index . A multigraph is called edge--crit…