Search arXivSearch

arXiv · 2608.02997

A directed flat wall theorem excluding a crossrow grid

Abstract

The graph minor project contains the most influential results in recent undirected graph theory research. There has been progress in recent years in generalising some of their results to directed graphs, with the directed grid theorem of Kawarabayashi and Kreutzer [STOC '15] and the directed flat wall theorem of Giannopoulou, Kawarabayashi, Kreutzer, and Kwon [SODA '22]. We discuss the two different versions of the existing directed flat wall theorem and their drawbacks. Then, we present an alternative directed flat wall theorem that excludes a different digraph as a butterfly minor. This new theorem lies ``in between'' the two existing ones and, as such, does not have either of these drawbacks. The proof of our flat wall theorem is based on the one by Giannopoulou, Kawarabayashi, Kreutzer, and Kwon [SODA '22], which has been adapted by Giannopoulou and Wiederrecht [STOC~'24]. Here we make further adjustments to match our setting.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Meike Hatzel, Ken-ichi Kawarabayashi, Stephan Kreutzer, Sebastian Wiederrecht. 2026-08-04. A directed flat wall theorem excluding a crossrow grid. https://arxiv.org/abs/2608.02997

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

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO