Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 226,088,316 papers from all fields of science
Search
Sign In
Create Free Account
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)
Create Alert
Alert
Related topics
Related topics
15 relations
Bicircular matroid
Binary matroid
Clique-sum
Dual matroid
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
Minimal tropical basis for Bergman fan of matroid
Yasuhito Nakajima
2019
Corpus ID: 119321981
The Bergman fan of a matroid is the intersection of tropical hyperplanes defined by the circuits. A tropical basis is a subset of…
Expand
2017
2017
On powers of Plücker coordinates and representability of arithmetic matroids
Matthias Lenz
Advances in Applied Mathematics
2017
Corpus ID: 119126956
2016
2016
Extended Formulations for Polytopes of Regular Matroids
R. Gurjar
,
Nisheeth K. Vishnoi
arXiv.org
2016
Corpus ID: 13345692
We present a simple proof of the fact that the base (and independence) polytope of a rank $n$ regular matroid over $m$ elements…
Expand
2013
2013
Dominating Circuits in Regular
Sean Mcguinness
2013
Corpus ID: 15609492
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…
Expand
2010
2010
A conjecture of Welsh revisited
Sean McGuinness
European journal of combinatorics (Print)
2010
Corpus ID: 16120028
2009
2009
Regularity of bondgraphs and directed bondgraphs
S. Birkett
Simulation modelling practice and theory
2009
Corpus ID: 27909234
2005
2005
Regular matroid decomposition via signed graphs
J. Geelen
,
B. Gerards
Journal of Graph Theory
2005
Corpus ID: 6453420
The key to Seymour's Regular Matroid Decomposition Theorem is his result that each 3‐connected regular matroid with no R10‐ or…
Expand
2005
2005
Nowhere zero 4‐flow in regular matroids
H. Lai
,
Xiangwen Li
,
Hoifung Poon
Journal of Graph Theory
2005
Corpus ID: 188767
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…
Expand
2005
2005
Flows in Oriented Matroids
W. Hochstättler
,
R. Nickel
2005
Corpus ID: 15046703
Recently Hochstattler and Nesetřil [3] introduced the flow lattice of an oriented matroid as generalization of the lattice of all…
Expand
1967
1967
On even matroids
W. T. Tutte
1967
Corpus ID: 124115127
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…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE