Matroid Theory
Matroid Theory is a branch of combinatorics that studies abstract structures generalizing the notion of linear independence in vector spaces and spanning trees in graphs.
3.1K
Publications
162.9K
Citations
3.8K
Authors
1.4K
Institutions
Publications per year
2017–2026
293
3.1K
A note on two problems in connexion with graphs
E. Dijkstra · Numerische Mathematik · 1959 · 23.8K citations
J. Fields · 2001 · 4.1K citations
Kathryn Fraughnaugh · Networks · 1997 · 1.7K citations
1–5 of 3.1K
3.8K
22
h-index
21
h-index
20
h-index
17
h-index
16
h-index
1–5 of 3.8K
1.4K

University of Waterloo
Waterloo, Canada
38 h-index
108 publications
6.7K citations
Massachusetts Institute of Technology
Cambridge, United States
28 h-index
73 publications
10.1K citations
Princeton University
Princeton, United States
25 h-index
48 publications
10.3K citations

Victoria University of Wellington
Wellington, New Zealand
24 h-index
58 publications
1.8K citations

Eötvös Loránd University
Budapest, Hungary
23 h-index
47 publications
2.4K citations
Rutgers, The State University of New Jersey
New Brunswick, United States
23 h-index
59 publications
2.8K citations

Hungarian Academy of Sciences
Budapest, Hungary
22 h-index
48 publications
3K citations

Centre National de la Recherche Scientifique
Paris, France
21 h-index
83 publications
2.5K citations
1–8 of 1.4K
280 publications · 15.1K citations
60
h-index
382 publications · 12K citations
51
h-index
173 publications · 5.5K citations
38
h-index
121 publications · 3.9K citations
35
h-index
122 publications · 3.5K citations
32
h-index
1–5