English
Related papers

Related papers: A matroid extension result

200 papers

We generalize the well-studied notion of a modular pair of a finite matroid to arbitrary families of sets in infinite matroids, and use it to develop the theory of infinite matroids in several as-yet-unexplored areas. Our results include a…

Combinatorics · Mathematics 2026-04-23 Mattias Ehatamm , Peter Nelson , Fernanda Rivera Omana

For a matroid $M$, an element $e$ such that both $M\backslash e$ and $M/e$ are regular is called a regular element of $M$. We determine completely the structure of non-regular matroids with at least two regular elements. Besides four small…

Combinatorics · Mathematics 2015-09-15 Sandra Kingan , Manoel Lemos

A partitioned matroid $(M, \{X_1,X_2,\dots,X_n\})$ consists of a matroid $M$ and a partition $\{X_1,X_2,\dots,X_n\}$ of its ground set. As such structures arise frequently in structural matroid theory, this paper introduces a general…

Combinatorics · Mathematics 2025-04-17 Nick Brettell , James Oxley , Charles Semple , Geoff Whittle

We prove that the extension complexity of the independence polytope of every regular matroid on $n$ elements is $O(n^6)$. Past results of Wong and Martin on extended formulations of the spanning tree polytope of a graph imply a $O(n^2)$…

Combinatorics · Mathematics 2019-12-23 Manuel Aprile , Samuel Fiorini

Given an $n$-connected binary matroid, we obtain a necessary and sufficient condition for its single-element coextensions to be $n$-connected.

Combinatorics · Mathematics 2018-12-05 Ganesh Mundhe , Y. M. Borse

Let $M$ be an internally $4$-connected binary matroid with every element in three triangles. Then $M$ has at least four elements $e$ such that si$(M/e)$ is internally 4-connected.

Combinatorics · Mathematics 2016-08-23 Carolyn Chun , James Oxley

We give a characterization of the internally 4-connected binary matroids that have no minor isomorphic to M(K3,3). Any such matroid is either cographic, or is isomorphic to a particular single-element extension of the bond matroid of a…

Combinatorics · Mathematics 2009-02-06 Dillon Mayhew , Gordon Royle , Geoff Whittle

We discuss several extension properties of matroids and polymatroids and their application as necessary conditions for the existence of different matroid representations, namely linear, folded linear, algebraic, and entropic…

Combinatorics · Mathematics 2025-02-24 Michael Bamiloshin , Oriol Farràs , Carles Padró

Generalizing a well known theorem for finite matroids, we prove that for every (infinite) connected matroid M there is a unique tree T such that the nodes of T correspond to minors of M that are either 3-connected or circuits or cocircuits,…

Combinatorics · Mathematics 2015-06-08 Elad Aigner-Horev , Reinhard Diestel , Luke Postle

Let $M$ be a 3-connected matroid, and let $N$ be a 3-connected minor of $M$. A pair $\{x_1,x_2\} \subseteq E(M)$ is $N$-detachable if one of the matroids $M/x_1/x_2$ or $M \backslash x_1 \backslash x_2$ is both 3-connected and has an…

Combinatorics · Mathematics 2021-04-26 Nick Brettell , Geoff Whittle , Alan Williams

Let $EX[M_1\dots, M_k]$ denote the class of binary matroids with no minors isomorphic to $M_1, \dots, M_k$. In this paper we give a decomposition theorem for $EX[S_{10}, S_{10}^*]$, where $S_{10}$ is a certain 10-element rank-4 matroid. As…

Combinatorics · Mathematics 2014-05-21 Sandra Kingan

Let $M$ be a $3$-connected binary matroid; $M$ is internally $4$-connected if one side of every $3$-separation is a triangle or a triad, and $M$ is $(4,4,S)$-connected if one side of every $3$-separation is a triangle, a triad, or a…

Combinatorics · Mathematics 2016-08-04 Carolyn Chun , James Oxley

A simple binary matroid is called $I_4$-free if none of its rank-4 flats are independent sets. These objects can be equivalently defined as the sets $E$ of points in $PG(n-1,2)$ for which $|E \cap F|$ is not a basis of $F$ for any…

Combinatorics · Mathematics 2020-05-04 Peter Nelson , Kazuhiro Nomoto

We use the Strong Splitter Theorem to decompose the excluded minor class of binary matroids with no $E_4$-minor. Using this theorem we can get the 3-decomposers and the extremal internally 4-connected matroids as well as any other important…

Combinatorics · Mathematics 2014-08-12 S. R. Kingan

Extending the notion of geometric bijections for regular matroids, introduced by the first and third author with Matthew Baker, we describe a family of bijections between bases of an oriented matroid and special orientations. These…

Combinatorics · Mathematics 2026-04-07 Spencer Backman , Francisco Santos , Chi Ho Yuen

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…

Combinatorics · Mathematics 2022-05-27 James Oxley , Zach Walsh

Let $M$ be a 3-connected matroid, and let $N$ be a 3-connected minor of $M$. We say that a pair $\{x_1,x_2\} \subseteq E(M)$ is $N$-detachable if one of the matroids $M/x_1/x_2$ or $M \backslash x_1 \backslash x_2$ is both 3-connected and…

Combinatorics · Mathematics 2020-02-25 Nick Brettell , Geoff Whittle , Alan Williams

Let $M$ be a $3$-connected matroid. A pair $\{e,f\}$ in $M$ is detachable if $M \backslash e \backslash f$ or $M / e / f$ is $3$-connected. Williams (2015) proved that if $M$ has at least 13 elements, then at least one of the following…

Combinatorics · Mathematics 2025-09-15 Nick Brettell , Charles Semple , Gerry Toft

An element $e$ of a $3$-connected matroid $M$ is elastic if ${\rm si}(M/e)$, the simplification of $M/e$, and ${\rm co}(M\backslash e)$, the cosimplification of $M\backslash e$, are both $3$-connected. It was recently shown that if…

Combinatorics · Mathematics 2022-07-20 George Drummond , Charles Semple

In this paper, we give a complete characterization of binary matroids with no $P_9$-minor. A 3-connected binary matroid $M$ has no $P_9$-minor if and only if $M$ is one of the internally 4-connected non-regular minors of a special…

Combinatorics · Mathematics 2014-10-06 Guoli Ding , Haidong Wu
‹ Prev 1 2 3 10 Next ›