English
Related papers

Related papers: On excluded minors of connectivity 2 for the class…

200 papers

The class of 2-regular matroids is a natural generalisation of regular and near-regular matroids. We prove an excluded-minor characterisation for the class of 2-regular matroids. The class of 3-regular matroids coincides with the class of…

Combinatorics · Mathematics 2023-09-07 Nick Brettell , James Oxley , Charles Semple , Geoff Whittle

If $\mathcal{C}$ is a minor-closed class of matroids, the class $\mathcal{C}'$ of integer polymatroids whose natural matroids are in $\mathcal{C}$ is also minor closed, as is the class $\mathcal{C}'_k$ of $k$-polymatroids in $\mathcal{C}'$.…

Combinatorics · Mathematics 2024-08-07 Joseph E. Bonin , Kevin Long

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…

Combinatorics · Mathematics 2024-08-27 Nick Brettell , Rudi Pendavingh

For a matroid $N$, a matroid $M$ is $N$-connected if every two elements of $M$ are in an $N$-minor together. Thus a matroid is connected if and only if it is $U_{1,2}$-connected. This paper proves that $U_{1,2}$ is the only connected…

Combinatorics · Mathematics 2018-07-24 Zachary Gershkoff , James Oxley

We present infinite sequences of excluded minors for both the class of lifted-graphic matroids and the class of frame matroids.

Combinatorics · Mathematics 2018-04-19 Rong Chen , Jim Geelen

The classes of even-cycle matroids, even-cycle matroids with a blocking pair, and even-cut matroids each have hundreds of excluded minors. We show that the number of excluded minors for these classes can be drastically reduced if we…

Combinatorics · Mathematics 2020-06-02 Kevin Grace , Stefan H. M. van Zwam

In earlier work, we characterized the class of matroids with no $M(C_4)$ as an induced minor and the class of matroids with no member of $\{M(C_4),M(K_4)\}$ as an induced minor. In this paper, for every two matroids in…

Combinatorics · Mathematics 2024-12-10 James Dylan Douthitt , James Oxley

We give an excluded-minor characterization for the class of matroids M in which M\e or M/e is binary for all e in E(M). This class is closely related to the class of matroids in which every member is binary or can be obtained from a binary…

Combinatorics · Mathematics 2013-07-30 James Oxley , Jesse Taylor

Brylawski and Seymour independently proved that if $M$ is a connected matroid with a connected minor $N$, and $e \in E(M) - E(N)$, then $M \backslash e$ or $M / e$ is connected having $N$ as a minor. This paper proves an analogous but…

Combinatorics · Mathematics 2019-08-28 Zachary Gershkoff , James Oxley

The class of quasi-graphic matroids, recently introduced by Geelen, Gerards, and Whittle, is minor closed and contains both the class of lifted-graphic matroids and the class of frame matroids, each of which generalises the class of graphic…

Combinatorics · Mathematics 2022-05-26 Rong Chen

Frame matroids and lifted-graphic matroids are two distinct minor-closed classes of matroids, each of which generalises the class of graphic matroids. The class of quasi-graphic matroids, recently introduced by Geelen, Gerards, and Whittle,…

Combinatorics · Mathematics 2017-06-21 Daryl Funk , Dillon Mayhew

We prove that, for each nonnegative integer k and each matroid N, if M is a 3-connected matroid containing N as a minor, and the the branch width of M is sufficiently large, then there is a k-element subset X of E(M) such that one of M\X…

Combinatorics · Mathematics 2014-12-12 Jim Geelen , Stefan H. M. van Zwam

We show that the class of bicircular matroids has only a finite number of excluded minors. Key tools used in our proof include representations of matroids by biased graphs and the recently introduced class of quasi-graphic matroids. We show…

Combinatorics · Mathematics 2023-10-24 Matt DeVos , Daryl Funk , Luis Goddyn , Gordon Royle

Let $\mathcal M$ be a class of matroids closed under minors and isomorphism. Let $N$ be a matroid in $\mathcal M$ with an exact $k$-separation $(A, B)$. We say $N$ is a $k$-decomposer for $\mathcal M$ having $(A, B)$ as an inducer, if every…

Combinatorics · Mathematics 2015-09-16 S. R. Kingan

Let $M$ be an excluded minor for the class of $\mathbb{P}$-representable matroids for some partial field $\mathbb{P}$, let $N$ be a $3$-connected strong $\mathbb{P}$-stabilizer that is non-binary, and suppose $M$ has a pair of elements…

Combinatorics · Mathematics 2023-09-07 Nick Brettell , James Oxley , Charles Semple , Geoff Whittle

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

Our splitter theorem for internally 4-connected binary matroids studies pairs of the form (M,N), where N and M are internally 4-connected binary matroids, M has a proper N-minor, and if M' is an internally 4-connected matroid such that M…

Combinatorics · Mathematics 2016-07-13 Carolyn Chun , Dillon Mayhew , James Oxley

If EE is a set of matroids, then ex(EE) denotes the set of matroids that have no minor isomorphic to a member of EE. If EE' is a subset of EE, we say that EE' is /superfluous/ if ex(EE - EE') - ex(EE) contains only finitely many 3-connected…

Combinatorics · Mathematics 2011-11-01 Rhiannon Hall , Dillon Mayhew , Stefan H. M. van Zwam

A matroid $N$ is said to be triangle-rounded in a class of matroids $\mathcal{M}$ if each $3$-connected matroid $M\in \mathcal{M}$ with a triangle $T$ and an $N$-minor has an $N$-minor with $T$ as triangle. Reid gave a result useful to…

Combinatorics · Mathematics 2021-01-14 João Paulo Costalonga , Xianqiang Zhou

The prism graph is the dual of the complete graph on five vertices with an edge deleted, $K_5\backslash e$. In this paper we determine the class of binary matroids with no prism minor. The motivation for this problem is the 1963 result by…

Combinatorics · Mathematics 2015-09-15 Sandra Kingan , Manoel Lemos
‹ Prev 1 2 3 10 Next ›