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

Authors

3.8K

  1. GW
    Geoff Whittle

    Victoria University of Wellington, New Zealand

    38 publications · 1.3K citations

    22

    h-index

  2. JO
    James Oxley

    Louisiana State University, United States

    52 publications · 1.3K citations

    21

    h-index

  3. PS
    Paul Seymour

    Princeton University, United States

    25 publications · 4.5K citations

    20

    h-index

  4. BS
    Bernd Sturmfels

    University of California, Berkeley, United States

    17 publications · 952 citations

    17

    h-index

  5. JG
    Jim Geelen

    University of Waterloo, Canada

    20 publications · 657 citations

    16

    h-index

1–5 of 3.8K

Venues

  1. Journal of Combinatorial Theory Series B

    280 publications · 15.1K citations

    60

    h-index

  2. Discrete Mathematics

    382 publications · 12K citations

    51

    h-index

  3. Discrete Applied Mathematics

    173 publications · 5.5K citations

    38

    h-index

  4. Linear Algebra and its Applications

    121 publications · 3.9K citations

    35

    h-index

  5. European Journal of Combinatorics

    122 publications · 3.5K citations

    32

    h-index

1–5