Matroid Connectivity is a structural property in matroid theory that characterizes the degree to which a matroid remains inseparable under deletions and contractions, distinguished by its reliance on the rank function to quantify the minimum number of elements whose removal increases the number of disconnected components in the matroid.
69
Publications
2.5K
Citations
87
Authors
62
Institutions
Publications per year
2017–2026
2
Parents
Publications
69
W. T. Tutte · Canadian Journal of Mathematics · 1966 · 313 citations · Full text
On the asymptotic proportion of connected matroids
Dillon Mayhew, Mike Newman, Dominic Welsh et al. · European Journal of Combinatorics · 2011 · 94 citations
1–5 of 69
Authors
87
- JO
13
h-index
- GW
6
h-index
- HW
5
h-index
- ML
3
h-index
- DM
3
h-index
1–5 of 87
Institutions
62
Louisiana State University
Baton Rouge, United States
11 h-index
20 publications
626 citations
Victoria University of Wellington
Wellington, New Zealand
8 h-index
11 publications
357 citations
University of Waterloo
Waterloo, Canada
8 h-index
11 publications
521 citations
Australian National University
Canberra, Australia
3 h-index
3 publications
71 citations
Purdue University West Lafayette
West Lafayette, United States
3 h-index
3 publications
56 citations
Universidade Federal de Pernambuco
Recife, Brazil
3 h-index
3 publications
39 citations
University of Canterbury
Christchurch, New Zealand
2 h-index
2 publications
32 citations
Southern University and Agricultural and Mechanical College
Baton Rouge, United States
2 h-index
2 publications
24 citations
1–8 of 62
Venues
- Journal of Combinatorial Theory Series B
19 publications · 833 citations
14
h-index
- Discrete Mathematics
11 publications · 173 citations
11
h-index
- European Journal of Combinatorics
6 publications · 207 citations
6
h-index
- Discrete Applied Mathematics
3 publications · 111 citations
3
h-index
- Discrete & Computational Geometry
3 publications · 36 citations
3
h-index
1–5