English
Related papers

Related papers: Detecting minors in matroids through triangles

200 papers

In unpublished work, Geelen proved that a matroid is near-regular if and only if it has no minor isomorphic to: U2,5; U3,5; the Fano plane and its dual; the non-Fano and its dual; the single-element deletion of AG(2,3), its dual, and the…

Combinatorics · Mathematics 2009-07-12 Rhiannon Hall , Dillon Mayhew , Stefan H. M. van Zwam

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

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

The {\em breadth} of a tangle $\mathcal{T}$ in a matroid is the size of the largest spanning uniform submatroid of the tangle matroid of $\mathcal{T}$. A matroid $M$ is {\em weakly $4$-connected} if it is 3-connected and whenever $(X,Y)$ is…

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

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, 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 $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 2022-01-04 Nick Brettell , Geoff Whittle , Alan Williams

Let $M$ be a matroid defined on a finite set $E$ and $L\subset E$. $L$ is locked in $M$ if $M|L$ and $M^*|(E\backslash L)$ are 2-connected, and $min\{r(L), r^*(E\backslash L)\} \geq 2$. Locked subsets characterize nontrivial facets of the…

Computational Complexity · Computer Science 2019-06-20 Brahim Chaourar

Let AG(3,2)xU(1,1) denote the binary matroid obtained from the direct sum of AG(3,2) and a coloop by completing the 3-point lines between every element in AG(3,2) and the coloop. We prove that every internally 4-connected binary matroid…

Combinatorics · Mathematics 2012-02-20 Dillon Mayhew , 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

For a matroid $M$ having $m$ rank-one flats, the density $d(M)$ is $\tfrac{m}{r(M)}$ unless $m = 0$, in which case $d(M)= 0$. A matroid is density-critical if all of its proper minors of non-zero rank have lower density. By a 1965 theorem…

Combinatorics · Mathematics 2020-06-02 Rutger Campbell , Kevin Grace , James Oxley , Geoff Whittle

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

Mayhew and Royle (2008) showed that there are 564 excluded minors for the class of GF(5)-representable matroids having at most 9 elements. We enumerate the excluded minors for GF(5)-representable matroids having 10 elements: there are…

Combinatorics · Mathematics 2025-04-17 Nick Brettell

In this paper we prove two main results about obstruction to graph planarity. One is that, if $G$ is a 3-connected graph with a $K_5$-minor and $T$ is a triangle of $G$, then $G$ has a $K_5$-minor $H$, such that $E(T)\cont E(H)$. Other is…

Combinatorics · Mathematics 2013-04-23 João Paulo Costalonga

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

Every minor-closed class of matroids of bounded branch-width can be characterized by a list of excluded minors, but unlike graphs, this list may need to be infinite in general. However, for each fixed finite field $\mathbb F$, the list…

Combinatorics · Mathematics 2025-08-15 Mamadou Mostapha Kanté , Eun Jung Kim , O-joung Kwon , Sang-il Oum

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…

Combinatorics · Mathematics 2021-01-07 Amanda Cameron , Dillon Mayhew

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

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

We investigate the set of excluded minors of connectivity 2 for the class of frame matroids. We exhibit a list $\mathcal{E}$ of 18 such matroids, and show that if $N$ is such an excluded minor, then either $N \in \mathcal{E}$ or $N$ is a…

Combinatorics · Mathematics 2016-11-08 Matt DeVos , Daryl Funk , Irene Pivotto