English
Related papers

Related papers: Packing A-Paths of Length Zero Modulo Four

200 papers

It is known that $A$-paths of length $0$ mod $m$ satisfy the Erd\H{o}s-P\'osa property if $m=2$ or $m=4$, but not if $m > 4$ is composite. We show that if $p$ is prime, then $A$-paths of length $0$ mod $p$ satisfy the Erd\H{o}s-P\'osa…

Combinatorics · Mathematics 2024-06-25 Robin Thomas , Youngho Yoo

Let $\Gamma$ be an Abelian group. In this paper I characterize the $A$-paths of weight $0\in\Gamma$ that have the Erd\H{o}s-P\'osa property. Using this in an auxiliary graph, one can also easily characterize the $A$-paths of weight…

Combinatorics · Mathematics 2020-10-05 Arthur Ulmer

We show that walls of size at least $6 \times 4$ do not have the edge-Erd\H{o}s-P\'{o}sa property.

Combinatorics · Mathematics 2023-07-24 Henning Bruhn , Raphael Steck

We characterize the obstructions to the Erd\H{o}s-P\'osa property of $A$-paths in unoriented group-labelled graphs. As a result, we prove that for every finite abelian group $\Gamma$ and for every subset $\Lambda$ of $\Gamma$, the family of…

Combinatorics · Mathematics 2026-01-21 O-joung Kwon , Youngho Yoo

A key feature of Simonovits' proof of the classic Erd\H{o}s-P\'osa theorem is a simple subgraph of the host graph, a frame, that determines the outcome of the theorem. We transfer this frame technique to $A$-paths. With it we deduce a…

Combinatorics · Mathematics 2018-01-24 Henning Bruhn , Matthias Heinlein , Felix Joos

For a fixed integer $\ell$ a path is long if its length is at least $\ell$. We prove that for all integers $k$ and $\ell$ there is a number $f(k,\ell)$ such that for every graph $G$ and vertex sets $A,B$ the graph $G$ either contains $k$…

Combinatorics · Mathematics 2019-03-20 Matthias Heinlein , Arthur Ulmer

A chordless cycle, or equivalently a hole, in a graph $G$ is an induced subgraph of $G$ which is a cycle of length at least $4$. We prove that the Erd\H{o}s-P\'osa property holds for chordless cycles, which resolves the major open question…

Combinatorics · Mathematics 2020-05-08 Eun Jung Kim , O-joung Kwon

We investigate which classes of infinite graphs have the Erd\H{o}s-P\'osa property (EPP). In addition to the usual EPP, we also consider the following infinite variant of the EPP: a class $\mathcal{G}$ of graphs has the $\kappa$-EPP, where…

Combinatorics · Mathematics 2024-11-06 Thilo Krill

I prove that even $A$-cycles have the edge-Erd\H{o}s-P\'osa property.

Combinatorics · Mathematics 2019-10-03 Henning Bruhn

We prove that there exists a function $f(k)=\mathcal{O}(k^2 \log k)$ such that for every $C_4$-free graph $G$ and every $k \in \mathbb{N}$, $G$ either contains $k$ vertex-disjoint holes of length at least $6$, or a set $X$ of at most $f(k)$…

Combinatorics · Mathematics 2021-05-26 Tony Huynh , O-joung Kwon

We prove that for every $t \in \mathbb{N}$, prime-length cycles do not have the $\frac{1}{t}$-integral Erd\H{o}s-P\'osa property, even when restricted to planar graphs. We in fact prove a more general density result. For every $t \in…

Combinatorics · Mathematics 2026-05-07 Maximilian Gorsky , Kevin Hendrey , Tony Huynh

We prove that the set of long cycles has the edge-Erd\H{o}s-P\'osa property: for every fixed integer $\ell\ge 3$ and every $k\in\mathbb{N}$, every graph $G$ either contains $k$ edge-disjoint cycles of length at least $\ell$ (long cycles) or…

Combinatorics · Mathematics 2017-05-31 Henning Bruhn , Matthias Heinlein , Felix Joos

Several min-max relations in graph theory can be expressed in the framework of the Erd\H{o}s-P\'osa property. Typically, this property reveals a connection between packing and covering problems on graphs. We describe some recent techniques…

Discrete Mathematics · Computer Science 2016-12-14 Jean-Florent Raymond , Dimitrios M. Thilikos

Robertson and Seymour proved that the family of all graphs containing a fixed graph $H$ as a minor has the Erd\H{o}s-P\'osa property if and only if $H$ is planar. We show that this is no longer true for the edge version of the…

Combinatorics · Mathematics 2018-10-01 Henning Bruhn , Matthias Heinlein , Felix Joos

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…

A class $\mathcal{F}$ of graphs has the induced Erd\H{o}s-P\'osa property if there exists a function $f$ such that for every graph $G$ and every positive integer $k$, $G$ contains either $k$ pairwise vertex-disjoint induced subgraphs that…

Discrete Mathematics · Computer Science 2018-11-13 O-joung Kwon , Jean-Florent Raymond

The packing problem and the covering problem are two of the most general questions in graph theory. The Erd\H{o}s-P\'{o}sa property characterizes the cases when the optimal solutions of these two problems are bounded by functions of each…

Combinatorics · Mathematics 2024-12-16 Chun-Hung Liu

We show that the moduli space of metrics of nonnegative sectional curvature on every homotopy ${\mathbb {R}} P^5$ has infinitely many path components. We also show that in each dimension $4k+1$ there are at least $2^{2k}$ homotopy ${\mathbb…

Differential Geometry · Mathematics 2020-10-27 Anand Dessai , David González-Álvaro

We prove that the number of quartic $S_4$--extensions of the rationals of given discriminant $d$ is $O_\eps(d^{1/2+\eps})$ for all $\eps>0$. For a prime number $p$ we derive that the dimension of the space of octahedral modular forms of…

Number Theory · Mathematics 2007-05-23 Juergen Klueners

We prove that a continuous path with finite length in a real Banach space cannot have infinitely many zero components in its signature unless it is tree-like. In particular, this allows us to strengthen a limit theorem for signature…

Classical Analysis and ODEs · Mathematics 2018-12-24 Horatio Boedihardjo , Xi Geng
‹ Prev 1 2 3 10 Next ›