Regular Matroids
Regular Matroids is a matroid that is representable over every field, distinguished by the property that its representation can be achieved via a totally unimodular matrix.
148
Publications
5.8K
Citations
172
Authors
120
Institutions
Publications per year
2017–2026
4
Parents
148
Decomposition of regular matroids
Paul Seymour · Journal of Combinatorial Theory Series B · 1980 · 749 citations
Greedy algorithm and symmetric matroids
André Bouchet · Mathematical Programming · 1987 · 226 citations
A higher invariant for matroids
Henry Crapo · Journal of Combinatorial Theory · 1967 · 161 citations
1–5 of 148
172
11
h-index
11
h-index
8
h-index
6
h-index
6
h-index
1–5 of 172
120

University of Waterloo
Waterloo, Canada
16 h-index
23 publications
1.5K citations

Victoria University of Wellington
Wellington, New Zealand
15 h-index
24 publications
685 citations
Louisiana State University
Baton Rouge, United States
12 h-index
20 publications
540 citations

Eötvös Loránd University
Budapest, Hungary
6 h-index
7 publications
809 citations
The University of Texas at Dallas
Richardson, United States
6 h-index
6 publications
175 citations
Rutgers, The State University of New Jersey
New Brunswick, United States
4 h-index
5 publications
97 citations

University of North Texas
Denton, United States
4 h-index
4 publications
110 citations

Tel Aviv University
Tel Aviv, Israel
4 h-index
6 publications
157 citations
1–8 of 120
40 publications · 2.3K citations
21
h-index
10 publications · 266 citations
10
h-index
6 publications · 117 citations
6
h-index
6 publications · 187 citations
6
h-index
5 publications · 70 citations
5
h-index
1–5