中文
相关论文

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

200 篇论文

We show that the number of linear spaces on a set of $n$ points and the number of rank-3 matroids on a ground set of size $n$ are both of the form $(cn+o(n))^{n^2/6}$, where $c=e^{\sqrt 3/2-3}(1+\sqrt 3)/2$. This is the final piece of the…

组合数学 · 数学 2024-05-31 Matthew Kwan , Ashwin Sah , Mehtaab Sawhney

For all positive integers $\ell$ and $r$, we determine the maximum number of elements of a simple rank-$r$ positroid without the rank-$2$ uniform matroid $U_{2,\ell+2}$ as a minor, and characterize the matroids with the maximum number of…

组合数学 · 数学 2025-12-18 Jonathan Boretsky , Zach Walsh

DeVos et al conjectured that if $M$ is a simple, regular matroid and $c$ is a colouring of the elements of $M$ with $r(M)+1$ colours, where each colour class has at least two elements, then $M$ contains a rainbow circuit of size at most…

组合数学 · 数学 2026-01-27 Sean McGuinness

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…

组合数学 · 数学 2014-10-29 Jim Geelen , Peter Nelson

Robertson and Seymour proved that every graph with sufficiently large treewidth contains a large grid minor. However, the best known bound on the treewidth that forces an $\ell\times\ell$ grid minor is exponential in $\ell$. It is unknown…

组合数学 · 数学 2012-05-21 Bruce A. Reed , David R. Wood

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…

组合数学 · 数学 2019-08-28 Zachary Gershkoff , James Oxley

We give a complete combinatorial characterization of homogeneous quadratic relations of "universal character" valid for minors of quantum matrices (more precisely, for minors in the quantized coordinate ring $O_q(M_{m,n}(K))$ of $m\times n$…

量子代数 · 数学 2017-01-01 Vladimir Danilov , Alexander Karzanov

The main result of this paper is that for every closed, connected, orientable, irreducible 3-manifold $M$, there is an integer $ n_M$ such that any abstract graph with no automorphism of order 2 which has a 3-connected minor whose genus is…

几何拓扑 · 数学 2016-11-18 Erica Flapan , Hugh Howards

A matroid is $\text{GF}(q)$-regular if it is representable over all proper superfields of the field $\text{GF}(q)$. We show that, for highly connected matroids having a large projective geometry over $\text{GF}(q)$ as a minor, the property…

组合数学 · 数学 2014-01-29 Peter Nelson , Stefan H. M. van Zwam

We consider the situation that M and N are 3-connected matroids such that |E(N)| > 3 and C* is a cocircuit of M with the property that M/y has an N-minor for some y in C*. We show that either there is an element x in C* such that si(M/x) or…

组合数学 · 数学 2008-04-14 Rhiannon Hall , Dillon Mayhew

Let $M$ be an arbitrary matroid with circuits $\mathcal{C}(M)$. We propose a definition of a derived matroid $\delta M$ that has as its ground set $\mathcal{C}(M)$. Unlike previous attempts of such a definition, our definition applies to…

组合数学 · 数学 2022-12-22 Olga Kuznetsova , Ragnar Freij-Hollanti , Relinde Jurrius

Blasiak verified a conjecture of White for graphic matroids by showing that the toric ideal of a graphic matroid is generated by quadrics. In this paper, we extend this result to frame matroids satisfying a linearity condition. Such classes…

组合数学 · 数学 2020-04-10 Sean McGuinness

The Sylvester-Gallai Theorem states that every rank-$3$ real-representable matroid has a two-point line. We prove that, for each $k\ge 2$, every complex-representable matroid with rank at least $4^{k-1}$ has a rank-$k$ flat with exactly $k$…

组合数学 · 数学 2024-04-30 Jim Geelen , Matthew E. Kroeker

It is possible to write the indicator function of any matroid polytope as an integer combination of indicator functions of Schubert matroid polytopes. In this way, every matroid on $n$ elements of rank $r$ can be thought of as a lattice…

组合数学 · 数学 2025-08-14 Luis Ferroni , Alex Fink

A parallel minor is obtained from a graph by any sequence of edge contractions and parallel edge deletions. We prove that, for any positive integer k, every internally 4-connected graph of sufficiently high order contains a parallel minor…

组合数学 · 数学 2008-02-12 Carolyn Chun , Guoli Ding , Bogdan Oporowski , Dirk Vertigan

We define a matroid invariant called the three-cosystole that is related to higher notions of cogirth for weighted matroids, and we prove an optimal upper bound for it in the class of regular matroids of rank at most six. To accomplish…

组合数学 · 数学 2026-05-21 James Dylan Douthitt , Elana Israel , Lee Kennard

We show that, if $k$ and $\ell$ are positive integers and $r$ is sufficiently large, then the number of rank-$k$ flats in a rank-$r$ matroid $M$ with no $U_{2,\ell+2}$-minor is less than or equal to number of rank-$k$ flats in a rank-$r$…

组合数学 · 数学 2013-09-18 Peter Nelson

We prove that every paving matroid that is an excluded minor of interval positroids can be reduced to one of three fundamental families of excluded minors of interval positroids by relaxing dependent hyperplanes. Using this result, we…

组合数学 · 数学 2023-12-07 Hyungju Park

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…

组合数学 · 数学 2016-11-08 Matt DeVos , Daryl Funk , Irene Pivotto

We show that a small cover of dimension $3$ is atorodal if and only if there is no $4$-belt in the corresponding simple polytope.

代数拓扑 · 数学 2019-01-15 Lisu Wu