arXiv 0902.01982009-02math.CO

Excluding Kuratowski graphs and their duals from binary matroids

Dillon Mayhew, Gordon Royle, Geoff Whittle

备注：: Some small changes

英文摘要：

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 {M(K3,3),M*(K3,3),M(K5),M*(K5)} that contains either M(K3,3) or M*(K3,3). We also describe a practical algorithm for testing whether a binary matroid has a minor in the subset. In addition we characterise the growth-rate of binary matroids with no M(K3,3)-minor, and we show that a binary matroid with no M(K3,3)-minor has critical exponent over GF(2) at most equal to four.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

排除不相交的 Kuratowski 图

Excluding disjoint Kuratowski graphs

本文研究不含 k 个互不相交 Kuratowski 子图的图结构，证明删除有界多个顶点后，剩余图可嵌入一个排斥所有 k-Kuratowski 图的曲面。

2024-05-08math.CO

排除 Kuratowski 图之和

Excluding sums of Kuratowski graphs

本文刻画了不包含由 $k$ 个 $K_5$ 或 $K_{3,3}$ 经 0-至 3-求和所得图为 minor 的图类，并证明其等价于图具有有界亏格。

2024-05-08math.CO

从$\boldsymbol{\rm \textbf{C}}$-可表示拟阵中排除一条线

Excluding a line from $\mathbb C$-representable matroids

本文针对无$U_{2,t+3}$-子拟阵的简单秩$r$ $\boldsymbol{\rm \textbf{C}}$-可表示拟阵，证明了足够大$r$时其最大元素数为$t{r\binom{2}+r}$，该结论由群标记图拟阵的更一般结果推导而来。

2025-02-12math.CO

Splitters and Decomposers for Binary Matroids

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 corollaries we obtain decomposition theorems for the classes obtained by excluding the Kuratowski graphs $EX[M(K_{3,3}), M^*(K_{3,3}), M(K_5), M^*(K_5)]$ and $EX[M(K_{3,3}), M^*(K_{3,3})]$. These decomposition theorems imply results on internally $4$-connected matroids by Zhou [\ref{Zhou2004}], Qin and Zhou [\ref{Qin2004}], and Mayhew, Royle and Whitte [\ref…

2014-05-20math.CO

Embedding simply connected 2-complexes in 3-space -- IV. Dual matroids

We introduce dual matroids of 2-dimensional simplicial complexes. Under certain necessary conditions, duals matroids are used to characterise embeddability in 3-space in a way analogous to Whitney's planarity criterion. We further use dual matroids to extend a 3-dimensional analogue of Kuratowski's theorem to the class of 2-dimensional simplicial complexes obtained from simply connected ones by identifying vertices or edges.

2017-09-14math.COmath.GT

从正阵胚中排除一条线

Excluding a line from positroids

McGill University（麦吉尔大学）；Auburn University（奥本大学）

本文确定了不含U_{2,ℓ+2}作为子式的简单秩r正阵胚的最大元素数，并刻画了达到最大值的结构，推广到双圆、格路、多路和colaminar等类。

2026-06-29math.CO

更多相关论文收起更多论文

Primitive elements in the matroid-minor Hopf algebra

We introduce the matroid-minor coalgebra C, which has labeled matroids as distinguished basis, and coproduct given by splitting a matroid into a submatroid and complementary contraction all possible ways. We introduce two new bases for C; the first of these is is related to the distinguished basis by Mobius inversion over the rank-preserving weak order on matroids, the second by Mobius inversion over the suborder excluding matroids that are irreducible with respect to the free product operation. We show that the subset of each of these bases corresponding to the set of irreducible matroids is …

2005-11-02math.CO

多拟阵的本质界及其在排除子式问题中的应用

The essential bound of a polymatroid and its applications to excluded minor problems

本文通过引入多拟阵的有界性概念，研究k-多拟阵的排除子式问题，并证明当k-自然拟阵属于排除U_{2,b}及其对偶的闭子式类时，排除子式列表有限。

2023-11-30math.CO

二元 matroid 与有限度的 pivot-minor

Binary matroids and degree-boundedness for pivot-minors

本文基于二元 matroid 结构定理，证明了排除 H 作为 pivot-minor 的 K_{s,s}-free 图类具有有界平均度，并展示了 K_{s,t}-free 双色圈图中存在度数受限的顶点。

2026-03-22math.CO

The densest matroids in minor-closed classes with exponential growth rate

The $\mathit{growth\ rate\ function}$ for a nonempty minor-closed class of matroids $\mathcal{M}$ is the function $h_{\mathcal{M}}(n)$ whose value at an integer $n \ge 0$ is defined to be the maximum number of elements in a simple matroid in $\mathcal{M}$ of rank at most $n$. Geelen, Kabell, Kung and Whittle showed that, whenever $h_{\mathcal{M}}(2)$ is finite, the function $h_{\mathcal{M}}$ grows linearly, quadratically or exponentially in $n$ (with base equal to a prime power $q$), up to a constant factor. We prove that in the exponential case, there are nonnegative integers $k$ and $d \le \…

2014-10-28math.CO

广义Whitney公式：关于ambigraphs和拟阵中破圈的推广

Generalized Whitney formulas for broken circuits in ambigraphs and matroids

将Whitney定理推广到ambigraph（包含超图和多重图）和拟阵，通过符号反转对合证明带权破圈和顶点权重的色对称函数公式。

2026-06-17math.CO

通过设计矩阵和电路不平衡度量的列数界排除线次式

Excluding a Line Minor via Design Matrices and Column Number Bounds for the Circuit Imbalance Measure

本文针对实矩阵证明列数受电路不平衡度量的四次方多项式界，推广整数矩阵结果，并通过排除线次式给出拟阵元素数的上界。

2025-10-23cs.DMmath.CO

Excluded $t$-factors in Bipartite Graphs: Unified Framework for Nonbipartite Matchings, Restricted 2-matchings, and Matroids

We propose a framework for optimal $t$-matchings excluding the prescribed $t$-factors in bipartite graphs. The proposed framework is a generalization of the nonbipartite matching problem and includes several problems, such as the triangle-free $2$-matching, square-free $2$-matching, even factor, and arborescence problems. In this paper, we demonstrate a unified understanding of these problems by commonly extending previous important results. We solve our problem under a reasonable assumption, which is sufficiently broad to include the specific problems listed above. We first present a min-max …

2017-08-02cs.DMcs.DSmath.CO