Transversal Matroids

Transversal Matroid is a matroid defined on the vertex set of a bipartite graph wherein the independent sets are precisely the partial transversals of one part of the vertex partition, distinguished by their representation through matchings in the graph.

39

Publications

1.8K

Citations

64

Authors

47

Institutions

Publications per year

2017–2026

1

Authors

64

  1. RA
    Richard A. Brualdi

    University of Wisconsin–Madison, United States

    4 publications · 111 citations

    4

    h-index

  2. JA
    J. A. Bondy

    University of Waterloo, Canada

    3 publications · 86 citations

    3

    h-index

  3. MW
    Magnus Wahlström

    Royal Holloway University of London, United Kingdom

    2 publications · 207 citations

    2

    h-index

  4. NI
    Nicole Immorlica

    Microsoft (United States), United States

    2 publications · 258 citations

    2

    h-index

  5. KP
    Kathleen P. Kiernan

    University of Wisconsin–Madison, United States

    2 publications · 62 citations

    2

    h-index

1–5 of 64

Venues

  1. Discrete Applied Mathematics

    3 publications · 117 citations

    3

    h-index

  2. Journal of Combinatorial Theory Series B

    3 publications · 118 citations

    3

    h-index

  3. SIAM Journal on Discrete Mathematics

    2 publications · 46 citations

    2

    h-index

  4. Discrete Mathematics

    2 publications · 54 citations

    2

    h-index

  5. The Electronic Journal of Combinatorics

    2 publications · 37 citations

    2

    h-index

1–5