English
Related papers

Related papers: Detecting minors in matroids through triangles

200 papers

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

A matroid M is unbreakable if it is connected and M/F is connected for every flat F of M . Oxley and Pfeil characterized the unbreakable graphic matroids, and Fife, Mayhew, Oxley, and Semple characterized the graphs underlying 3-connected…

Combinatorics · Mathematics 2026-05-14 Sayantani Bhattacharya , John David Clifton , Zach Walsh

We call an oriented matroid Mandel if it has an extension in general position which makes all programs with that extension Euclidean. If $L$ is the minimum number of mutations adjacent to an element of the groundset, we call an oriented…

Combinatorics · Mathematics 2025-02-20 Michael Wilhelmi

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…

Combinatorics · Mathematics 2022-02-22 Rigoberto Florez , David Forge

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…

Combinatorics · Mathematics 2020-12-23 Vaidy Sivaraman , Daniel Slilaty

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…

Computational Complexity · Computer Science 2024-08-21 Eun Jung Kim , Arnaud de Mesmay , Tillmann Miltzow

We introduce the minor-closed, dual-closed class of multi-path matroids. We give a polynomial-time algorithm for computing the Tutte polynomial of a multi-path matroid, we describe their basis activities, and we prove some basic structural…

Combinatorics · Mathematics 2024-08-07 Joseph E. Bonin , Omer Gimenez

This paper studies structural aspects of lattice path matroids, a class of transversal matroids that is closed under taking minors and duals. Among the basic topics treated are direct sums, duals, minors, circuits, and connected flats. One…

Combinatorics · Mathematics 2024-08-07 Joseph E. Bonin , Anna de Mier

This paper proves the existence of potentials of the first and second kind of a Frobenius like structure in a frame which encompasses families of arrangements. The frame uses the notion of matroids. For the proof of the existence of the…

Algebraic Geometry · Mathematics 2017-12-25 Claus Hertling , Alexander Varchenko

This paper defines the q-analogue of a matroid and establishes several properties like duality, restriction and contraction. We discuss possible ways to define a q-matroid, and why they are (not) cryptomorphic. Also, we explain the…

Combinatorics · Mathematics 2020-05-25 Relinde Jurrius , Ruud Pellikaan

We provide a new axiom system for flag matroids, characterize representability of uniform flag matroids, and give forbidden minor characterizations of full flag matroids that are representable over $\mathbb{F}_2$ and $\mathbb{F}_3$ along…

Combinatorics · Mathematics 2026-04-15 Daniel Irving Bernstein , Nathaniel Vaduthala

If $\mathcal{C}$ is a minor-closed class of matroids, then the class $\widetilde{\mathcal{C}}'_k$ of $k$-polymatroids whose $k$-natural matroids are in $\mathcal{C}$ is also minor-closed. We investigate the following question: When…

Combinatorics · Mathematics 2023-04-07 Fiona Young

Let $M$ be a 3-connected binary matroid and let $Y(M)$ be the set of elements of $M$ avoiding at least $r(M)+1$ non-separating cocircuits of $M$. Lemos proved that $M$ is non-graphic if and only if $Y(M)\neq\emp$. We generalize this result…

Combinatorics · Mathematics 2012-11-27 João Paulo Costalonga

This technical report accompanies the following three papers. It contains the computations necessary to verify some of the results claimed in those papers. [1] Carolyn Chun, Deborah Chun, Dillon Mayhew, and Stefan H. M. van Zwam.…

Combinatorics · Mathematics 2015-11-12 Carolyn Chun , Deborah Chun , Benjamin Clark , Dillon Mayhew , Geoff Whittle , Stefan H. M. van Zwam

Let $M$ be an excluded minor for the class of $\mathbb{P}$-representable matroids for some partial field $\mathbb P$, and let $N$ be a $3$-connected strong $\mathbb{P}$-stabilizer that is non-binary. We prove that either $M$ is bounded…

Combinatorics · Mathematics 2021-02-04 Nick Brettell , Ben Clark , James Oxley , Charles Semple , Geoff Whittle

A partial Steiner triple system of order $u$ is a pair $(U,\mathcal{A})$ where $U$ is a set of $u$ elements and $\mathcal{A}$ is a set of triples of elements of $U$ such that any two elements of $U$ occur together in at most one triple. If…

Combinatorics · Mathematics 2020-03-12 Darryn Bryant , Ajani De Vas Gunasekara , Daniel Horsley

Let the sign components of the maximal covectors of a simple oriented matroid M be represented by the real numbers -1 and 1. Consider the vertex set V(R) of a symmetric cycle R of adjacent topes in the tope graph of M as a subposet of the…

Combinatorics · Mathematics 2013-04-01 Andrey O. Matveev

We discuss several extension properties of matroids and polymatroids and their application as necessary conditions for the existence of different matroid representations, namely linear, folded linear, algebraic, and entropic…

Combinatorics · Mathematics 2025-02-24 Michael Bamiloshin , Oriol Farràs , Carles Padró

The components of K*-vectors associated to a simple oriented matroid M are the numbers of general or special tope committees for M. Using the principle of inclusion-exclusion, we determine how the reorientations of M on one-element subsets…

Combinatorics · Mathematics 2010-10-19 Andrey O. Matveev

Networks are frequently studied algebraically through matrices. In this work, we show that networks may be studied in a more abstract level using results from the theory of matroids by establishing connections to networks by decomposition…

Combinatorics · Mathematics 2015-11-17 Konstantinos Papalamprou , Leonidas Pitsoulis