中文
相关论文

相关论文: The family of bicircular matroids closed under dua…

200 篇论文

The classes of bicircular matroids and lattice path matroids are closed under minors. The complete list of excluded minors for the class of lattice path matroids is known, and it has been recently shown that the analogous list for the class…

组合数学 · 数学 2024-02-20 Emma Hogan , Charles Semple

We provide a characterisation of when a single-element contraction of a transversal matroid is itself transversal. Using this characterisation, we define a new class of transversal matroids closed under minors, which we call path-circular…

组合数学 · 数学 2025-11-18 Gerry Toft

If $\mathcal{C}$ is a minor-closed class of matroids, the class $\mathcal{C}'$ of integer polymatroids whose natural matroids are in $\mathcal{C}$ is also minor closed, as is the class $\mathcal{C}'_k$ of $k$-polymatroids in $\mathcal{C}'$.…

组合数学 · 数学 2024-08-07 Joseph E. Bonin , Kevin Long

One characterization of binary matroids is that the symmetric difference of every pair of intersecting circuits is a disjoint union of circuits. This paper considers circuit-difference matroids, that is, those matroids in which the…

组合数学 · 数学 2020-08-11 George Drummond , Tara Fife , Kevin Grace , James Oxley

Lattice path matroids and bicircular matroids are two well-known classes of transversal matroids. In the seminal work of Bonin and de Mier about structural properties of lattice path matroids, the authors claimed that lattice path matroids…

组合数学 · 数学 2022-10-07 Santiago Guzmán-Pro , Winfried Hochstättler

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

The classes of even-cycle matroids, even-cycle matroids with a blocking pair, and even-cut matroids each have hundreds of excluded minors. We show that the number of excluded minors for these classes can be drastically reduced if we…

组合数学 · 数学 2020-06-02 Kevin Grace , Stefan H. M. van Zwam

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

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

We conjecture that the class of frame matroids can be characterised by a sentence in the monadic second-order logic of matroids, and we prove that there is such a characterisation for the class of bicircular matroids. The proof does not…

组合数学 · 数学 2021-03-02 Daryl Funk , Dillon Mayhew , Mike Newman

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

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 are the edge sets of those subgraphs of $G$ that contain at least two cycles, and are…

组合数学 · 数学 2016-07-05 Rong Chen , Zifei Gao

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

Generalizing a well known theorem for finite matroids, we prove that for every (infinite) connected matroid M there is a unique tree T such that the nodes of T correspond to minors of M that are either 3-connected or circuits or cocircuits,…

组合数学 · 数学 2015-06-08 Elad Aigner-Horev , Reinhard Diestel , Luke Postle

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 provide a combinatorial study of split matroids, a class that was motivated by the study of matroid polytopes from a tropical geometry point of view. A nice feature of split matroids is that they generalize paving matroids, while being…

组合数学 · 数学 2022-02-10 Kristóf Bérczi , Tamás Király , Tamás Schwarcz , Yutaro Yamaguchi , Yu Yokoi

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

We consider three forms of composition of matroids, each of which extends the category of bimatroids to a rigid monoidal category. Many well-known constructions are functorial or defined by morphisms in these categories. Motivating examples…

组合数学 · 数学 2024-03-07 Kevin Purbhoo

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…

组合数学 · 数学 2024-08-07 Joseph E. Bonin , Anna de Mier

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
‹ 上一页 1 2 3 10 下一页 ›