中文
相关论文

相关论文: Almost every matroid has an $M(K_4)$- or a $\mathc…

200 篇论文

In 1963, Halin and Jung proved that every simple graph with minimum degree at least four has $K_5$ or $K_{2,2,2}$ as a minor. Mills and Turner proved an analog of this theorem by showing that every $3$-connected binary matroid in which…

组合数学 · 数学 2025-07-15 Matthew Mizell , James Oxley

We consider some applications of our characterisation of the internally 4-connected binary matroids with no M(K3,3)-minor. We characterise the internally 4-connected binary matroids with no minor in some subset of…

组合数学 · 数学 2017-03-03 Dillon Mayhew , Gordon Royle , Geoff Whittle

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…

组合数学 · 数学 2009-02-06 Dillon Mayhew , Gordon Royle , Geoff Whittle

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…

组合数学 · 数学 2024-12-10 James Dylan Douthitt , James Oxley

In this note we investigate some matroid minor structure results. In particular, we present sufficient conditions, in terms of {\em triangles}, for a matroid to have either $U_{2,4}$ or $F_7$ or $M(K_5)$ as a minor.

组合数学 · 数学 2014-12-17 Boris Albar , Daniel Gonçalves , Jorge L. Ramírez Alfonsín

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…

组合数学 · 数学 2022-05-27 James Oxley , Zach Walsh

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…

组合数学 · 数学 2014-12-12 Jim Geelen , Stefan H. M. van Zwam

We prove a conjecture of Geelen, Gerards, and Whittle that for any finite field $GF(q)$ and any integer $t$, every cosimple $GF(q)$-representable matroid with sufficiently large girth contains either $M(K_t)$ or $M(K_t)^*$ as a minor.

组合数学 · 数学 2025-05-01 James Davies , Meike Hatzel , Kolja Knauer , Rose McCarty , Torsten Ueckerdt

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,…

组合数学 · 数学 2017-06-21 Daryl Funk , Dillon Mayhew

We use counting arguments to show that asymptotically almost all sparse paving matroids contain an $H$-minor, where $H$ falls into one of several simple classes of matroids. Furthermore the result holds for all $H$ in a larger class of…

组合数学 · 数学 2016-05-10 Will Critchlow

We introduce delta-graphic matroids, which are matroids whose bases form graphic delta-matroids. The class of delta-graphic matroids contains graphic matroids as well as cographic matroids and is a proper subclass of the class of regular…

组合数学 · 数学 2022-10-05 Duksang Lee , Sang-il Oum

Consider a random $n\times m$ matrix $A$ over the finite field of order $q$ where every column has precisely $k$ nonzero elements, and let $M[A]$ be the matroid represented by $A$. In the case that q=2, Cooper, Frieze and Pegden (RS\&A…

组合数学 · 数学 2024-01-22 Pu Gao , Peter Nelson

We discuss a conjecture of Ingleton on excluded minors for base-orderability, and, extending a result he stated, we prove that infinitely many of the matroids that he identified are excluded minors for base-orderability, as well as for the…

组合数学 · 数学 2024-08-07 Joseph E. Bonin , Thomas J. Savitsky

We prove that for every proper minor-closed class $M$ of matroids representable over a prime field, there exists a constant-competitive matroid secretary algorithm for the matroids in $M$. This result relies on the extremely powerful…

组合数学 · 数学 2019-10-03 Tony Huynh , Peter Nelson

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…

组合数学 · 数学 2014-10-06 Guoli Ding , Haidong Wu

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…

组合数学 · 数学 2023-10-24 Matt DeVos , Daryl Funk , Luis Goddyn , Gordon Royle

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…

组合数学 · 数学 2023-09-07 Nick Brettell , James Oxley , Charles Semple , Geoff Whittle

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…

组合数学 · 数学 2021-01-14 João Paulo Costalonga , Xianqiang Zhou

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…

组合数学 · 数学 2013-07-30 James Oxley , Jesse Taylor

Bicircular lift matroids are a class of matroids defined on the edge set of a graph. For a given graph $G$, the circuits of its bicircular lift matroid $L(G)$ are the edge sets of those subgraphs of $G$ that contain at least two cycles, and…

组合数学 · 数学 2016-09-13 Rong Chen
‹ 上一页 1 2 3 10 下一页 ›