Search arXiv⌕ Search

arXiv · 2610.20391

Potatoes and Onions

Abstract

The first major step in the theory of graph minors of Robertson and Seymour was the grid theorem, a fundamental duality result describing that any graph of sufficiently high treewidth must contain a large grid as a minor. Since this pioneering work, multiple grid theorems have been established in structural graph theory, linking various width parameters of combinatorial objects with the non-existence of grid-like obstructions. In particular, Kawarabayashi and Kreutzer [STOC'15] proved a variant of the grid theorem for directed graphs that links directed treewidth with the non-existence of topological minors of large cylindrical walls. On the other hand, to study immersions of undirected graphs $-$ another containment relation that focuses on edge-disjointness, rather than vertex-disjointness $-$ Wollan [JCTB'15] introduced a parameter, tree-cutwidth, and proved that it is dual to immersions of large walls. In this work, we present a version of Wollan's parameter for directed graphs, the directed tree-cutwidth. The main result is a grid theorem for directed tree-cutwidth, establishing that it is dual to directed immersions of large cylindrical walls.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Marcin Briański, Meike Hatzel, Karolina Okrasa, Michał Pilipczuk. 2026-10-14. Potatoes and Onions. https://arxiv.org/abs/2610.20391

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

KEEP EXPLORING

Related papers

Morse theory and moduli spaces of simple polylines and polygons

We prove that a smooth $d$-manifold $M$ is diffeomorphic to $\mathbb R^d$ if it admits a Lyapunov-Reeb function, i.e., a smooth map $f\colon M\to\mathbb R$ that is proper, lower-bounded, and possesses exactly one critical point. We further establish that the moduli spaces of simple polylines and positively oriented polygons with fixed or varying side lengths are diffeomorphic to Euclidean spaces, by explicitly constructing Lyapunov-Reeb functions on these spaces. This yields a refined resolution to the Carpenter's Rule Problem and settles a conjecture proposed by González and Sedano-Mendoza. In addition, we describe foliation structures of the moduli spaces and develop algorithms for the refolding problem.

math.CO↗

Linear bounds for rich-neighbor edge-colorings

An edge in a proper edge-coloring is rich if all edges adjacent to it receive pairwise distinct colors. A rich-neighbor edge-coloring is a proper edge-coloring in which every non-isolated edge is adjacent to a rich edge. The rich-neighbor chromatic index $\rn(G)$ is the minimum number of colors in such a coloring. We prove that every loopless multigraph $G$ satisfies $\rn(G)\le3χ'(G)$, where $χ'(G)$ is the chromatic index. Exact values are also determined for complete bipartite graphs and complete graphs. For all positive integers $m,n$, $\rn(K_{m,n})=m+n-1$, except that $\rn(K_{2,2})=4$. For $n\ge3$, $\rn(K_n)=2n-3$, except that $\rn(K_4)=6$ and $\rn(K_6)=10$. Moreover, for $n\ge7$, the rich edges in every optimal rich-neighbor edge-coloring of $K_n$ form a star forest.

math.CO↗

Coefficient lifting for skew divided differences and triple Schubert coefficients

Skew divided difference operators \(\partial_{w/v}\), introduced by Macdonald, play an important role in the study of Schubert polynomials and their structure constants. For permutations \(u,v,w\in S_n\), we show that the coefficient of each monomial \(\xx^α\) in \(\partial_{w/v}\SSch_u(\xx;\yy)\), where \(\SSch_u(\xx;\yy)\) is the double Schubert polynomial, is a single triple Schubert coefficient evaluated at \(\tb=0\), whose indices form an explicit lift of \((u,v,w)\) to \(S_{n+\absα}\). As an application, we show that every coefficient of \(\partial_{w/v}\SSch_u(\xx)\) is a single Schubert structure constant. This gives a new proof of Kirillov's conjecture that these coefficients are nonnegative.

math.CO↗