中文
相关论文

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

200 篇论文

We prove that if M is a vertically 4-connected matroid with a modular flat X of rank at least three, then every representation of M | X over a finite field F extends to a unique F-representation of M. A corollary is that when F has order q,…

组合数学 · 数学 2013-04-25 Jim Geelen , Rohan Kapadia

The foundation of a matroid is a canonical algebraic invariant which classifies representations of the matroid up to rescaling equivalence. Foundations of matroids are pastures, a simultaneous generalization of partial fields and…

组合数学 · 数学 2020-08-04 Matthew Baker , Oliver Lorscheid

For any minor-closed class of matroids over a fixed finite field, we state an exact structural characterization for the sufficiently connected matroids in the class. We also state a number of conjectures that might be approachable using the…

组合数学 · 数学 2015-01-06 Jim Geelen , Bert Gerards , Geoff Whittle

We prove that every simple graph of order 12 which has minimum degree 6 contains a K_6 minor.

组合数学 · 数学 2020-12-09 Ryan Odeneal , Andrei Pavelescu

We classify all matroids with at most 8 elements that have the half-plane property, and we provide a list of some matroids on 9 elements that have, and that do not have the half-plane property. Furthermore, we prove that several classes of…

组合数学 · 数学 2023-10-25 Mario Kummer , Büşra Sert

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…

组合数学 · 数学 2015-09-15 Sandra Kingan , Manoel Lemos

A theorem of Tutte states that every 4-connected non-hamiltonian graph contains $K_{3,3}$ as a minor. We strengthen this result by proving that such a graph must contain $K_{3,4}$ as a minor, thereby confirming a special case of a…

组合数学 · 数学 2025-06-26 On-Hei Solomon Lo

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…

组合数学 · 数学 2020-06-02 Rutger Campbell , Kevin Grace , James Oxley , Geoff Whittle

A matroid $M$ is an ordered pair $(E,I)$, where $E$ is a finite set called the ground set and a collection $I\subset 2^{E}$ called the independent sets which satisfy the conditions: (i) $\emptyset \in I$, (ii) $I'\subset I \in I$ implies…

计算复杂性 · 计算机科学 2024-08-21 Eun Jung Kim , Arnaud de Mesmay , Tillmann Miltzow

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…

组合数学 · 数学 2012-06-22 Carolyn Chun , Dillon Mayhew , James Oxley

We prove that the maximum size of a simple binary matroid of rank $r \geq 5$ with no AG(3,2)-minor is $\binom{r+1}{2}$ and characterise those matroids achieving this bound. When $r \geq 6$, the graphic matroid $M(K_{r+1})$ is the unique…

组合数学 · 数学 2013-04-10 Joseph P. S. Kung , Dillon Mayhew , Irene Pivotto , Gordon F. Royle

A minor-closed class of matroids is (strongly) fractal if the number of n-element matroids in the class is dominated by the number of n-element excluded minors. We conjecture that when K is an infinite field, the class of K-representable…

组合数学 · 数学 2019-08-01 Dillon Mayhew , Mike Newman , Geoff Whittle

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.

组合数学 · 数学 2016-08-23 Carolyn Chun , James Oxley

If $G$ is a looped graph, then its adjacency matrix represents a binary matroid $M_{A}(G)$ on $V(G)$. $M_{A}(G)$ may be obtained from the delta-matroid represented by the adjacency matrix of $G$, but $M_{A}(G)$ is less sensitive to the…

组合数学 · 数学 2013-09-04 Robert Brijder , Hendrik Jan Hoogeboom , Lorenzo Traldi

We characterize the 3-connected members of the intersection of the class of bicircular and cobicircular matroids. Aside from some exceptional matroids with rank and corank at most 5, this class consists of just the free swirls and their…

组合数学 · 数学 2020-12-23 Vaidy Sivaraman , Daniel Slilaty

We construct a $\wedge$-homogeneous universal simple matroid of rank $3$, i.e. a countable simple rank~$3$ matroid $M_*$ which $\wedge$-embeds every finite simple rank $3$ matroid, and such that every isomorphism between finite…

逻辑 · 数学 2018-10-04 Gianluca Paolini

We prove that every infinite sequence of skew-symmetric or symmetric matrices M_1, M_2, ... over a fixed finite field must have a pair M_i, M_j (i<j) such that M_i is isomorphic to a principal submatrix of the Schur complement of a…

组合数学 · 数学 2014-03-26 Sang-il Oum

We show that each real-representable matroid is a minor of a complex-representable excluded minor for real-representability. More generally, for an infinite field $\mathbb{F}_1$ and a field extension $\mathbb{F}_2$, if…

组合数学 · 数学 2019-11-14 Rutger Campbell , Jim Geelen

We construct a new family of minimal non-orientable matroids of rank three. Some of these matroids embed in Desarguesian projective planes. This answers a question of Ziegler: for every prime power $q$, find a minimal non-orientable…

组合数学 · 数学 2022-02-22 Rigoberto Florez , David Forge

For a matroid of rank $r$ and a non-negative integer $k$, an element is called $k$-loose if every circuit containing it has size greater than $r-k$. Zaslavsky and the author characterized all binary matroids with a $1$-loose element. In…

组合数学 · 数学 2025-03-17 Jagdeep Singh