3 papers
math.CO2025
The structure of -free tournaments
Seokbeom Kim, Taite LaGrange, Mathieu Rundström +2
We extend the list of tournaments for which the complete structural description for tournaments excluding as a subtournament is known. Specifically, let be a t…
math.CO2025
Intersections of graphs and -boundedness
Aristotelis Chaniotis, Hidde Koerts, Sophie Spirkl
Given graphs , their intersection is the graph . Given graph classes $\mathcal{G}_{1}, \ldots , \m…
math.CO2025
Orientations of cycles in digraphs of high chromatic number and high minimum out-degree
Hidde Koerts, Benjamin Moore, Sophie Spirkl
We characterize all orientations of cycles for which for every fixed there exists a constant such that every digraph without loops or parallel…