Related papers: Infinite Gammoids: Minors and Duality
We prove that every locally finite, quasi-transitive graph with a thick end whose cycle space is generated by cycles of bounded length contains the full-grid as an asymptotic minor and as a diverging minor. This in particular includes all…
For any genuinely ramified morphism $f\, :\, Y\, \longrightarrow\, X$ between irreducible smooth projective curves we prove that $\overline{(Y\times_X Y) \setminus \Delta}$ is connected, where $\Delta\, \subset\, Y\times_X Y$ is the…
We study topological full groups attached to groupoid models for left regular representations of Garside categories. Groups arising in this way include Thompson's group $V$ and many of its variations such as R\"over-Nekrashevych groups. Our…
We provide a full classification of all families of matroids that are closed under duality and minors, and for which the Tutte polynomial is a universal valuative invariant. There are four inclusion-wise maximal families, two of which are…
We study finite four-valent graphs Gamma admitting an edge-transitive group G of automorphisms such that G determines and preserves an edge-orientation on Gamma, and such that at least one G-normal quotient is a cycle (a quotient modulo the…
A result of Mason, as refined by Ingleton, characterizes transversal matroids as the matroids that satisfy a set of inequalities that relate the ranks of intersections and unions of nonempty sets of cyclic flats. We prove counterparts, for…
We describe a construction for embeddings of complete graphs where the dual has a cutvertex and the genus is close to the minimum genus of the primal graph. When the number of vertices is congruent to 5 modulo 12, we further guarantee that…
We introduce a connectivity function for infinite matroids with properties similar to the connectivity function of a finite matroid, such as submodularity and invariance under duality. As an application we use it to extend Tutte's linking…
Split matroids form a minor-closed class of matroids, and are defined by placing conditions on the system of split hyperplanes in the matroid base polytope. They can equivalently be defined in terms of structural properties involving cyclic…
A polytope is called indecomposable if it cannot be expressed nontrivially as a Minkowski sum of other polytopes. Since Gale introduced the concept in 1954, several increasingly strong criteria have been developed to characterize…
End-periodic homotopy equivalences of infinite, locally finite graphs serve as dimension-one analogs of the end-periodic automorphisms traditionally defined on infinite-type surfaces. We demonstrate that if $\Gamma$ is an infinite graph…
In 2006 Bonato and Tardif posed the Tree Alternative Conjecture (TAC): the equivalence class of a tree under the embeddability relation is, up to isomorphism, either trivial or infinite. In 2022 LaFlamme, et al. provided a rigorous…
A groupoid is a small category in which each morphism has an inverse. A topological groupoid is a groupoid in which both sets of objects and morphisms have topologies such that all groupoid structure maps are continuous. The notion of…
If $M$ is a matroid, then a simple matroid $M'$ with the same rank as $M$ is an adjoint of $M$ if there is an inclusion-reversing embedding $\phi$ of the lattice of flats of $M$ into the lattice of flats of $M'$ such that $\phi$ maps the…
Recently, the authors have proved the finiteness of common zeros of two iterated rational maps under some compositional independence assumptions. In this article, we advance towards a question of Hsia and Tucker on a Zariski non-density of…
Colourings and flows are well-known dual notions in Graph Theory. In turn, the definition of flows in graphs naturally extends to flows in oriented matroids. So, the colour-flow duality gives a generalization of Hadwiger's conjecture about…
A lattice path matroid is a transversal matroid for which some collection of incomparable intervals in some linear order on the ground set is a presentation. We characterize the minor-closed class of lattice path matroids by its excluded…
We show that posets of bounded height whose cover graphs exclude a fixed graph as a topological minor have bounded dimension. This result was already proven by Walczak. However, our argument is entirely combinatorial and does not rely on…
It is well known that every sufficiently large connected graph has, as an induced subgraph, $K_n$, $K_{1,n}$, or an $n$-vertex path. A 2023 paper of Allred, Ding, and Oporowski identified a set of unavoidable induced subgraphs of…
A super-minimally $k$-connected matroid is a $k$-connected matroid having no proper $k$-connected restriction of size at least $2k-2$. This extends the corresponding concept for graphs. For $k=2$ and $k=3$, we determine the maximum size of…