Skip to search formSkip to main contentSkip to account menu

Regular matroid

Known as: Regular 
In mathematics, a regular matroid is a matroid that can be represented over all fields.
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
The Bergman fan of a matroid is the intersection of tropical hyperplanes defined by the circuits. A tropical basis is a subset of… 
2016
2016
We present a simple proof of the fact that the base (and independence) polytope of a rank $n$ regular matroid over $m$ elements… 
2013
2013
In 1971, Nash-Williams proved that if G is a simple 2-connected graph on n vertices having minimum degree at least 3(n+2), then… 
2012
2012
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… 
2009
2005
2005
Jensen and Toft 8 conjectured that every 2‐edge‐connected graph without a K5‐minor has a nowhere zero 4‐flow. Walton and Welsh 19… 
1967
1967
It is s hown in [1] I that e very graphic matroid is regular ([1], 5.63) and even ([IJ, 9.23). Moreover a regular matroid c an be…