34 citations · 188 across the 74 of their papers we have counts for
6 papers · 1 filter
Bipartite Minors
Maria Chudnovsky, Gil Kalai, Eran Nevo +2
We introduce a notion of bipartite minors and prove a bipartite analog of Wagner's theorem: a bipartite graph is planar if and only if it does not contain as a bipartite…
Wheel-free planar graphs
Pierre Aboulker, Maria Chudnovsky, Paul Seymour +1
A \emph{wheel} is a graph formed by a chordless cycle and a vertex not in that has at least three neighbors in . We prove that every 3-connected planar graph that do…
Immersion in four-edge-connected graphs
Maria Chudnovsky, Zdeněk Dvořák, Tereza Klimošová +1
Fix g>1. Every graph of large enough tree-width contains a g x g grid as a minor; but here we prove that every four-edge-connected graph of large enough tree-width contains a g x g…
Rooted grid minors
Dániel Marx, Paul Seymour, Paul Wollan
Intuitively, a tangle of large order in a graph is a highly-connected part of the graph, and it is known that if a graph has a tangle of large order then it has a large grid minor.…
The Minimal Automorphism-Free Tree
Ilhee Kim, Ringi Kim, Paul Seymour
A finite tree with is called {\it automorphism-free} if there is no non-trivial automorphism of . Let be the poset with the element set of al…
Excluding Pairs of Graphs
Maria Chudnovsky, Alex Scott, Paul Seymour
For a graph and a set of graphs , we say that is {\em -free} if no induced subgraph of is isomorphic to a member of . Given an in…