English
Related papers

Related papers: Contracting an element from a cocircuit

200 papers

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

Let $\tilde{K}_{3,n}$, $n\geq 3$, be the simple graph obtained from $K_{3,n}$ by adding three edges to a vertex part of size three. We prove that if $H$ is a hyperplane of a 3-connected matroid $M$ and $M \not\cong M^*(\tilde{K}_{3,n})$,…

Combinatorics · Mathematics 2008-02-26 Rhiannon Hall

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

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

Let $M$ be a $3$-connected binary matroid; $M$ is called 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

It follows by Bixby's Lemma that if $e$ is an element of a $3$-connected matroid $M$, then either ${\rm co}(M\delete e)$, the cosimplification of $M\delete e$, or ${\rm si}(M/e)$, the simplification of $M/e$, is $3$-connected. A natural…

Combinatorics · Mathematics 2021-11-24 George Drummond , Zachary Gershkoff , Susan Jowett , Charles Semple , Jagdeep Singh

In this paper we establish a variation of the Splitter Theorem. Let $M$ and $N$ be simple 3-connected matroids. We say that $x\in E(M)$ is vertically $N$-contractible if $si(M/x)$ is a 3-connected matroid with an $N$-minor. Whittle (for…

Combinatorics · Mathematics 2015-09-02 João Paulo Costalonga

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

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 and N be internally 4-connected binary matroids such that M has a proper N-minor, and |E(N)| is at least seven. As part of our project to develop a splitter theorem for internally 4-connected binary matroids, we prove the following…

Combinatorics · Mathematics 2012-06-22 Carolyn Chun , Dillon Mayhew , James Oxley

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

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

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

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

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

The Splitter Theorem states that, if $N$ is a 3-connected proper minor of a 3-connected matroid $M$ such that, if $N$ is a wheel or whirl then $M$ has no larger wheel or whirl, respectively, then there is a sequence $M_0,..., M_n$ of…

Combinatorics · Mathematics 2015-09-15 S. R. Kingan , Manoel Lemos

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

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

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
‹ Prev 1 2 3 10 Next ›