Search

Let ${\cal G}$ and ${\cal H}$ be minor-closed graph classes. The pair $({\cal H},{\cal G})$ is an Erd\H{o}s-P\'osa pair (EP-pair) if there is a function $f$ where, for every $k$ and every $G\in{\cal G},$ either $G$ has $k$ pairwise vertex-disjoint subgraphs not belonging to ${\cal H},$ or there is a set $S\subseteq V(G)$ where $|S|\leq f(k)$ and $G-S\in{\cal H}.$ The classic result of Erd\H{o}s and P\'osa says that if $\mathcal{F}$ is the class of forests, then $({\cal F},{\cal G})$ is an EP-pair for every ${\cal G}$. The class ${\cal G}$ is an EP-counterexample for ${\cal H}$ if ${\cal G}$ is minimal with the property that $({\cal H},{\cal G})$ is not an EP-pair. We prove that for every ${\cal H}$ the set $\mathfrak{C}_{\cal H}$ of all EP-counterexamples for ${\cal H}$ is finite. In particular, we provide a complete characterization of $\mathfrak{C}_{\cal H}$ for every ${\cal H}$ and give a constructive upper bound on its size. Each class ${\cal G}\in \mathfrak{C}_{\cal H}$ can be described as all minors of a sequence of grid-like graphs $\langle \mathscr{W}_{k} \rangle_{k\in \mathbb{N}}.$ Moreover, each $\mathscr{W}_{k}$ admits a half-integral packing: $k$ copies of some $H\not\in{\cal H}$ where no vertex is used more than twice. This gives a complete delineation of the half-integrality threshold of the Erd\H{o}s-P\'osa property for minors and yields a constructive proof of Thomas' conjecture on the half-integral Erd\H{o}s-P\'osa property for minors (recently confirmed, non-constructively, by Liu). Let $h$ be the maximum size of a graph in ${\cal H}.$ For every class ${\cal H},$ we construct an algorithm that, given a graph $G$ and a $k,$ either outputs a half-integral packing of $k$ copies of some $H \not\in {\cal H}$ or outputs a set of at most ${2^{k^{\cal O}_h(1)}}$ vertices whose deletion creates a graph in ${\cal H}$ in time $2^{2^{k^{{\cal O}_h(1)}}}\cdot |G|^4\log |G|.$, Comment: Accepted to FOCS 2024

In 1986 Robertson and Seymour proved a generalization of the seminal result of Erd\H{o}s and P\'osa on the duality of packing and covering cycles: A graph has the Erd\H{o}s-P\'osa property for minors if and only if it is planar. In particular, for every non-planar graph $H$ they gave examples showing that the Erd\H{o}s-P\'osa property does not hold for $H.$ Recently, Liu confirmed a conjecture of Thomas and showed that every graph has the half-integral Erd\H{o}s-P\'osa property for minors. Liu's proof is non-constructive and to this date, with the exception of a small number of examples, no constructive proof is known. In this paper, we initiate the delineation of the half-integrality of the Erd\H{o}s-P\'osa property for minors. We conjecture that for every graph $H,$ there exists a unique (up to a suitable equivalence relation) graph parameter ${\textsf{EP}}_H$ such that $H$ has the Erd\H{o}s-P\'osa property in a minor-closed graph class $\mathcal{G}$ if and only if $\sup\{\textsf{EP}_H(G) \mid G\in\mathcal{G}\}$ is finite. We prove this conjecture for the class $\mathcal{H}$ of Kuratowski-connected shallow-vortex minors by showing that, for every non-planar $H\in\mathcal{H},$ the parameter ${\sf EP}_H(G)$ is precisely the maximum order of a Robertson-Seymour counterexample to the Erd\H{o}s-P\'osa property of $H$ which can be found as a minor in $G.$ Our results are constructive and imply, for the first time, parameterized algorithms that find either a packing, or a cover, or one of the Robertson-Seymour counterexamples, certifying the existence of a half-integral packing for the graphs in $\mathcal{H}.$

We introduce a graph-parametric framework for obtaining obstruction characterizations of graph parameters with respect to partial ordering relations. For this, we define the notions of class obstruction, parametric obstruction, and universal obstruction as combinatorial objects that determine the asymptotic behavior of graph parameters. Our framework permits a unified framework for classifying graph parameters. Under this framework, we survey existing graph- theoretic results on most known graph parameters. Also we provide some unifying results on their classification.

We introduce the notion of a universal obstruction of a graph parameter with respect to some quasi-ordering relation on graphs. Universal obstructions may serve as a canonical obstruction characterization of the approximate behaviour of graph parameters. We provide an order-theoretic characterization of the finiteness of universal obstructions and, when this is the case, we present some algorithmic implications on the existence of fixed-parameter algorithms.

Many standard graph classes are known to be characterized by means of layouts (a permutation of its vertices) excluding some patterns. Important such graph classes are among others: proper interval graphs, interval graphs, chordal graphs, permutation graphs, (co-)comparability graphs. For example, a graph $G=(V,E)$ is a proper interval graph if and only if $G$ has a layout $L$ such that for every triple of vertices such that $x\prec_L y\prec_L z$, if $xz\in E$, then $xy\in E$ and $yz\in E$. Such a triple $x$, $y$, $z$ is called an indifference triple and layouts excluding indifference triples are known as indifference layouts. In this paper, we investigate the concept of tree-layouts. A tree-layout $T_G=(T,r,\rho_G)$ of a graph $G=(V,E)$ is a tree $T$ rooted at some node $r$ and equipped with a one-to-one mapping $\rho_G$ between $V$ and the nodes of $T$ such that for every edge $xy\in E$, either $x$ is an ancestor of $y$ or $y$ is an ancestor of $x$. Clearly, layouts are tree-layouts. Excluding a pattern in a tree-layout is defined similarly as excluding a pattern in a layout, but now using the ancestor relation. Unexplored graph classes can be defined by means of tree-layouts excluding some patterns. As a proof of concept, we show that excluding non-indifference triples in tree-layouts yields a natural notion of proper chordal graphs. We characterize proper chordal graphs and position them in the hierarchy of known subclasses of chordal graphs. We also provide a canonical representation of proper chordal graphs that encodes all the indifference tree-layouts rooted at some vertex. Based on this result, we first design a polynomial time recognition algorithm for proper chordal graphs. We then show that the problem of testing isomorphism between two proper chordal graphs is in P, whereas this problem is known to be GI-complete on chordal graphs., Comment: 33 pages, 13 figures

A strict bramble of a graph $G$ is a collection of pairwise-intersecting connected subgraphs of $G.$ The order of a strict bramble ${\cal B}$ is the minimum size of a set of vertices intersecting all sets of ${\cal B}.$ The strict bramble number of $G,$ denoted by ${\sf sbn}(G),$ is the maximum order of a strict bramble in $G.$ The strict bramble number of $G$ can be seen as a way to extend the notion of acyclicity, departing from the fact that (non-empty) acyclic graphs are exactly the graphs where every strict bramble has order one. We initiate the study of this graph parameter by providing three alternative definitions, each revealing different structural characteristics. The first is a min-max theorem asserting that ${\sf sbn}(G)$ is equal to the minimum $k$ for which $G$ is a minor of the lexicographic product of a tree and a clique on $k$ vertices (also known as the lexicographic tree product number). The second characterization is in terms of a new variant of a tree decomposition called lenient tree decomposition. We prove that ${\sf sbn}(G)$ is equal to the minimum $k$ for which there exists a lenient tree decomposition of $G$ of width at most $k.$ The third characterization is in terms of extremal graphs. For this, we define, for each $k,$ the concept of a $k$-domino-tree and we prove that every edge-maximal graph of strict bramble number at most $k$ is a $k$-domino-tree. We also identify three graphs that constitute the minor-obstruction set of the class of graphs with strict bramble number at most two. We complete our results by proving that, given some $G$ and $k,$ deciding whether ${\sf sbn}(G) \leq k$ is an ${\sf NP}$-complete problem.