Related papers: On Seymour's Decomposition Theorem

Mader conjectured that for any tree $T$ of order $m$, every $k$-connected graph $G$ with minimum degree at least $\lfloor\frac{3k}{2}\rfloor +m-1$ contains a subtree $T'\cong T$ such that $G-V(T')$ is $k$-connected. In this paper, we give a…

Let $\mathcal{N}$ be a set of matroids. A matroid $M$ is strictly $\mathcal{N}$-fragile if $M$ has a member of $\mathcal{N}$ as minor and, for all $e \in E(M)$, at least one of $M\backslash e$ and $M/e$ has no minor in $\mathcal{N}$. In…

We give a short proof that every finite graph (or matroid) has a tree-decomposition that displays all maximal tangles. This theorem for graphs is a central result of the graph minors project of Robertson and Seymour and the extension to…

For finitely generated modules $N \subsetneq M$ over a Noetherian ring $R$, we study the following properties about primary decomposition: (1) The Compatibility property, which says that if $\ass (M/N)=\{P_1, P_2, ..., P_s\}$ and $Q_i$ is a…

We present a short and clear proof of the following particular case of a 2006 result of Melikhov-Schepin: Let $K$ be a $k$-dimensional simplicial complex and $K*[3]$ the union of three cones over $K$ along their common bases. If $2d\ge3k+3$…

The components of K*-vectors associated to a simple oriented matroid M are the numbers of general or special tope committees for M. Using the principle of inclusion-exclusion, we determine how the reorientations of M on one-element subsets…

A matrix is $k$-nonnegative if all its minors of size $k$ or less are nonnegative. We give a parametrized set of generators and relations for the semigroup of $k$-nonnegative $n\times n$ invertible matrices in two special cases: when $k =…

Let $\M$ be a type ${\rm II_1}$ factor and let $\tau$ be the faithful normal tracial state on $\M$. In this paper, we prove that given finite elements $X_1,\cdots X_n \in \M$, there is a finite decomposition of the identity into $N \in…

Geelen, Gerards, and Whittle [3] announced the following result: let $q = p^k$ be a prime power, and let $\mathcal{M}$ be a proper minor-closed class of $\mathrm{GF}(q)$-representable matroids, which does not contain $\mathrm{PG}(r-1,p)$…

We give a short proof of Bing's characterization of $S^3$: a compact, connected 3-manifold $M$ is $S^3$ if and only if every knot in $M$ is isotopic into a ball.

This sequel to our paper (Infinite gammoids, 2014) considers minors and duals of infinite gammoids. We prove that a class of gammoids definable by digraphs not containing a certain type of substructure, called an outgoing comb, is…

Halin proved that every minimally $k$-connected graph has a vertex of degree $k$. More generally, does every minimally vertically $k$-connected matroid have a $k$-element cocircuit? Results of Murty and Wong give an affirmative answer when…

We describe an implementation of a computer search for the "small" excluded minors for a class of matroids representable over a partial field. Using these techniques, we enumerate the excluded minors on at most 15 elements for both the…

A particular two-parameter class of little string theories can be described by $M$ parallel M5-branes probing a transverse affine $A_{N-1}$ singularity. We previously discussed the duality between the theories labelled by $(N,M)$ and…

One characterization of binary matroids is that the symmetric difference of every pair of intersecting circuits is a disjoint union of circuits. This paper considers circuit-difference matroids, that is, those matroids in which the…

We characterise the following property by six obstructions: given a graphic matroid $M$ and a set $X$ of its elements, when is $M$ the cycle matroid of a graph $G$ such that $X$ is a connected edge set in $G$?

We conjecture that the class of frame matroids can be characterised by a sentence in the monadic second-order logic of matroids, and we prove that there is such a characterisation for the class of bicircular matroids. The proof does not…

For each odd integer $k\ge 5$, we prove that, if $M$ is a simple rank-$r$ binary matroid with no odd circuit of length less than $k$ and with $|M| > k 2^{r-k+1}$, then $M$ is isomorphic to a restriction of the rank-$r$ binary affine…

In this paper, we investigate the classes of matroid intersection admitting a solution for the problem of partitioning the ground set $E$ into $k$ common independent sets, where $E$ can be partitioned into $k$ independent sets in each of…

The classical Kneser-Milnor theorem says that every closed oriented connected 3-dimensional manifold admits a unique connected sum decomposition into manifolds that cannot be decomposed any further. We discuss to what degree such…