3 papers
math.CO2026
Minors of plane digraphs
Maria Chudnovsky, Paul Seymour
A digraph is a ``semi-strong minor'' of another, , if a subdivision of can be obtained from a subdigraph of by contracting strongly-connected subdigraphs to single v…
math.CO2024
Excluding sums of Kuratowski graphs
Neil Robertson, Paul Seymour
We prove that a graph does not contain as a minor a graph formed by 0-, 1-, 2- or 3-summing copies of or , if and only if it has bounded genus.
math.CO2024
Excluding disjoint Kuratowski graphs
Neil Robertson, Paul Seymour
A graph is a ``-Kuratowski graph'' if it has exactly components, each isomorphic to or to . We prove that if a graph contains no -Kuratowski graph as a…