scholarly journals Cyclic flats of binary matroids

2021 ◽  
Vol 127 ◽  
pp. 102165
Author(s):  
Ragnar Freij-Hollanti ◽  
Matthias Grezet ◽  
Camilla Hollanti ◽  
Thomas Westerbäck
Keyword(s):  
2001 ◽  
Vol 10 (5) ◽  
pp. 453-461 ◽  
Author(s):  
TALMAGE JAMES REID ◽  
HAIDONG WU

We generalize a minimal 3-connectivity result of Halin from graphs to binary matroids. As applications of this theorem to minimally 3-connected matroids, we obtain new results and short inductive proofs of results of Oxley and Wu. We also give new short inductive proofs of results of Dirac and Halin on minimally k-connected graphs for k ∈ {2,3}.


2010 ◽  
Vol 133 (1-2) ◽  
pp. 203-225 ◽  
Author(s):  
João Gouveia ◽  
Monique Laurent ◽  
Pablo A. Parrilo ◽  
Rekha Thomas

2000 ◽  
Vol 131 (1) ◽  
pp. 1-13 ◽  
Author(s):  
Martin Aigner ◽  
Hans Mielke
Keyword(s):  

1987 ◽  
pp. 28-39 ◽  
Author(s):  
J.C. Fournier
Keyword(s):  

10.37236/8742 ◽  
2019 ◽  
Vol 26 (3) ◽  
Author(s):  
James Oxley ◽  
Suijie Wang
Keyword(s):  

In 1971, Rota introduced the concept of derived matroids to investigate "dependencies among dependencies" in matroids. In this paper, we study the derived matroid $\delta M$ of an ${\mathbb F}$-representation of a matroid $M$. The matroid $\delta M$ has a naturally associated ${\mathbb F}$-representation, so we can define a sequence $\delta M$, $\delta^2 M$, \dots . The main result classifies such derived sequences of matroids into three types: finite, cyclic, and divergent. For the first two types, we obtain complete characterizations and thereby resolve some of the questions that Longyear posed in 1980 for binary matroids. For the last type, the divergence is estimated by the coranks of the matroids in the derived sequence.


1996 ◽  
Vol 66 (2) ◽  
pp. 334-360 ◽  
Author(s):  
Guoli Ding ◽  
Bogdan Oporowski ◽  
James Oxley ◽  
Dirk Vertigan
Keyword(s):  

2014 ◽  
Vol 52 ◽  
pp. 1-59 ◽  
Author(s):  
Carolyn Chun ◽  
Dillon Mayhew ◽  
James Oxley

Sign in / Sign up

Export Citation Format

Share Document