相关论文: Cycles of Well-Linked Sets I: an Elementary Bound …

In 2015, Kawarabayashi and Kreutzer proved the Directed Grid Theorem - the generalisation of the well-known Excluded Grid Theorem to directed graphs - confirming a conjecture by Reed, Johnson, Robertson, Seymour and Thomas from the…

The celebrated Erd\H{o}s-P\'osa theorem states that every undirected graph that does not admit a family of $k$ vertex-disjoint cycles contains a feedback vertex set (a set of vertices hitting all cycles in the graph) of size $O(k \log k)$.…

The grid theorem, originally proved by Robertson and Seymour in Graph Minors V in 1986, is one of the most central results in the study of graph minors. It has found numerous applications in algorithmic graph structure theory, for instance…

Given a digraph $D$, let $c(D)$ denote the largest integer $k$ such that there are $k$ openly disjoint cycles through a vertex, i.e., a collection of directed cycles $C_1,\ldots,C_k$ through a common vertex $v$ such that…

We prove that for every set $S$ of vertices of a directed graph $D$, the maximum number of vertices in $S$ contained in a collection of vertex-disjoint cycles in $D$ is at least the minimum size of a set of vertices that hits all cycles…

The Grid Theorem of Robertson and Seymour [JCTB, 1986], is one of the most important tools in the field of structural graph theory, finding numerous applications in the design of algorithms for undirected graphs. An analogous version of the…

We study the Excluded Grid Theorem of Robertson and Seymour. This is a fundamental result in graph theory, that states that there is some function $f: Z^+\rightarrow Z^+$, such that for all integers $g>0$, every graph of treewidth at least…

We study the Excluded Grid Theorem, a fundamental structural result in graph theory, that was proved by Robertson and Seymour in their seminal work on graph minors. The theorem states that there is a function $f: \mathbb{Z}^+ \to…

A classical result by Erdos and Posa states that there is a function $f: {\mathbb N} \rightarrow {\mathbb N}$ such that for every $k$, every graph $G$ contains $k$ pairwise vertex disjoint cycles or a set $T$ of at most $f(k)$ vertices such…

Aboulker, Adler, Kim, Sintiari, and Trotignon conjectured that every graph with bounded maximum degree and large treewidth must contain, as an induced subgraph, a large subdivided wall, or the line graph of a large subdivided wall. This…

In [Directed tree-width, J. Combin. Theory Ser. B 82 (2001), 138-154] we introduced the notion of tree-width of directed graphs and presented a conjecture, formulated during discussions with Noga Alon and Bruce Reed, stating that a digraph…

For their famous algorithm for the disjoint paths problem, Robertson and Seymour proved that there is a function $f$ such that if the tree-width of a graph $G$ with $k$ pairs of terminals is at least $f(k)$, then $G$ contains a…

The celebrated Erd\H{o}s-P\'{o}sa Theorem, in one formulation, asserts that for every $c\geq 1$, graphs with no subgraph (or equivalently, minor) isomorphic to the disjoint union of $c$ cycles have bounded treewidth. What can we say about…

Treewidth and Hadwiger number are two of the most important parameters in structural graph theory. This paper studies graph classes in which large treewidth implies the existence of a large complete graph minor. To formalise this, we say…

We show that for every $\eta>0$ every sufficiently large $n$-vertex oriented graph D of minimum semidegree exceeding $(1 + \eta) k/2$ contains every balanced antidirected tree with $k$ edges and bounded maximum degree, if $k \ge \eta n$. In…

One of the key results in Robertson and Seymour's seminal work on graph minors is the Grid-Minor Theorem (also called the Excluded Grid Theorem). The theorem states that for every grid $H$, every graph whose treewidth is large enough…

The Flat Wall Theorem of Robertson and Seymour states that there is some function $f$, such that for all integers $w,t>1$, every graph $G$ containing a wall of size $f(w,t)$, must contain either (i) a $K_t$-minor; or (ii) a small subset…

In the first paper of the Graph Minors series [JCTB '83], Robertson and Seymour proved the Forest Minor theorem: the $H$-minor-free graphs have bounded pathwidth if and only if $H$ is a forest. In recent years, considerable effort has been…

An induced packing of cycles in a graph is a set of vertex-disjoint cycles with no edges between them. We generalise the classic Erd\H{o}s-P\'osa theorem to induced packings of cycles. More specifically, we show that there exist functions…

A classical result of Robertson and Seymour states that the set of graphs containing a fixed planar graph $H$ as a minor has the so-called Erd\H{o}s-P\'osa property; namely, there exists a function $f$ depending only on $H$ such that, for…