A Polynomial Erdős-Pósa bound for Eulerian digraphs

Esther Galby; Roohani Sharma; Bart van der Steenhoven

Home/Archive/arXiv

arXiv · 2611.06250

A Polynomial Erdős-Pósa bound for Eulerian digraphs

Esther Galby·Roohani Sharma·Bart van der Steenhoven

View original source ↗Read source document ↗Export metadata ↓

Abstract

In [Combinatorica 1996], Reed, Robertson, Seymour and Thomas proved Younger's conjecture dating back to 1973 that states that directed cycles have the Erdős-Pósa property. Specifically, they showed that every directed graph $D$ contains either $k$ arc-disjoint cycles or a set of at most $f(k)$ arcs that intersect every directed cycle. The function $f$, depending only on $k$, is however notoriously large--in fact, not even elementary. The first improvement on this function was only very recently provided by Hatzel, Kreutzer, Milani, and Muzi [FOCS 2024] who showed that $f$ can be taken to be an exponential tower of height $8$. In this work, we improve this function to $O(k^4)$ in the case where the digraph is Eulerian. This also answers an open question by Wahlström [Springer Monographs in Mathematics 2018] who asked explicitly when Eulerian digraphs have a polynomial Erdős-Pósa property. The only other known result about Erdős-Pósa on Eulerian digraphs is a result from Seymour [Combinatorica 1996] who showed that $f(k)=k$ when the Eulerian digraph admits a linkless embedding in 3-space, and such an equality is not possible for general Eulerian digraphs. We also complement our positive result, by showing that the result of Seymour cannot be extended to give a linear bound ($O(k)$) on general Eulerian digraphs, by showing that even on Eulerian digraphs the lower bound for the Erdős-Pósa property is $Ω(k \log k)$.

Explore related subjects

cs.DM cs.DS math.CO

Keep this discovery

Explore connections, maps & timelines

BibTeX RIS

Esther Galby, Roohani Sharma, Bart van der Steenhoven. 2026-11-04. A Polynomial Erdős-Pósa bound for Eulerian digraphs. https://arxiv.org/abs/2611.06250

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

On weighted partial triangulations of convex polygons

We study the problem of sampling weighted partial triangulations of a convex polygon with $n+2$ sides. We consider the distribution $π_{n,λ}$ under which each partial triangulation $σ$ is assigned probability proportional to $λ^{|σ|}$, where $λ>0$ is a model parameter and $|σ| \in \{0,\dots,n-1\}$ denotes the number of diagonals in $σ$. This model belongs to a broad class of weighted geometric partition problems that include lattice triangulations and dyadic tilings, and is closely related to several classical combinatorial structures, including the full triangulations of a convex polygon and the associated Catalan structures. Our main result is a simple exact sampling algorithm for $π_{n,λ}$ with expected running time $O\big((\min\{n,n\sqrtλ\}+1)\log n\big)$, which is optimal up to the logarithmic factor.

cs.DM↗

arXiv2026

Graph Similarity Meets Optimal Transport

A natural way to compare two graphs is to align their vertex sets by a bijection and to measure the difference of the aligned adjacency matrices in a matrix norm. Depending on the norm, this yields, for example, the edit distance, the cut distance, the spectral distance, and the local edit distance. To make these distances applicable to graphs of different order, one can consider blowups of the graphs or, equivalently, relax bijections to fractional alignments, that is, optimal transport plans between the uniform distributions on the vertex sets, in the spirit of Gromov-Wasserstein distances. We investigate how much the optimal transport versions can differ from their bijective counterparts, that is, we quantify their integrality gaps. For the edit distance, we improve the best known upper bound on the integrality gap from 3 to 2 and the lower bound from 6/5 to 4/3. For the cut distance, we approach Lovász's conjecture that $δ_\square \le 2δ_\square^{\rm OT}$ from both sides. We improve the previously best known upper bound $δ_\square \le 32 \cdot (δ_\square^{\rm OT})^{1/67}$ (Borgs, Chayes, Lovász, Sós and Vesztergombi, Adv. Math. 2008) to $δ_\square \le C_\varepsilon \cdot (δ_\square^{\rm OT})^{1-\varepsilon}$ for every $\varepsilon > 0$, and we construct graphs $G,H$ with $δ_\square(G,H) = 2δ_\square^{\rm OT}(G,H)$, establishing a factor-2 lower bound that matches Lovász's conjecture. For the local edit and spectral distances, we obtain upper bounds of order $\sqrt{t\ln(1/t)}$ and $\sqrt{t}$, respectively, where $t$ is the corresponding optimal transport distance, and we show that, unlike for the edit and cut distances, no linear upper bounds are possible. Finally, we show that computing the optimal transport distances is NP-hard, and we give hardness of approximation results for the cut, spectral, and local edit distances.

cs.DM↗

arXiv2026

Classifying K-Geodetic Graphs Via Combinatorial Designs and Distance-regularity

The classification of K-geodetic graphs is a fundamental problem in graph theory concerning the number of shortest paths connecting pairs of vertices. A graph is called K-geodetic if every pair of distinct vertices is joined by at most K geodesics, where a geodesic is a shortest path between two vertices. The cases K=1,2,3 correspond, respectively, to geodetic, bigeodetic, and trigeodetic graphs. Despite substantial progress in the study of their structural properties, a comprehensive classification of these graph families remains elusive. This paper develops a research framework for investigating the classification problems by combining metric graph theory, distance-regular graphs, algebraic graph theory, and combinatorial design theory. Particular attention is given to distance-regular graphs, for which the number of geodesics between vertices at a fixed distance is determined by the intersection numbers of the graph. This property converts the K-geodetic condition into a finite collection of arithmetic inequalities. We establish the resulting necessary conditions for K=1,2,3, discuss representative examples, and distinguish these conditions from the stronger requirements needed to prove the existence and classification of graphs with a given intersection array. The paper also investigates the potential role of balanced incomplete block designs (BIBDs) in constructing and organizing families of K-geodetic graphs. Finally, it proposes a computational research methodology based on constraint satisfaction, graph-isomorphism testing, exhaustive enumeration, and machine-assisted conjecture generation.

cs.DM↗