A central theorem of matroid 3-connectivity is established that has a number of new and old connectivity results as corollaries. The proof of this theorem relies on a matrix theory developed here for partial matroid representations
AbstractA collection F of 3-connected matroids is triangle-rounded if, whenever M is a 3-connected m...
This paper proves that, for every integernexceeding two, there is a numberN(n) such that every 3-con...
A matroid is a mathematical object that generalizes and connects notions of independence that arise ...
AbstractIt is well known that a matroid is 2-connected if and only if every 2-element set is contain...
AbstractIt is well known that a matroid is 2-connected if and only if every 2-element set is contain...
AbstractA standard matrix representation A of a matroid M represents M relative to a fixed basis B. ...
AbstractIn this paper we prove the following theorem: Let M be a 3-connected matroid other than the ...
Matroid theory is the study of abstract properties of linear dependence. A matroid consists of a fin...
In combinatorics, a matroid is a discrete object that generalizes various notions of dependence that...
Connectivity is a fundamental tool for matroid theorists, which has become increasingly important in...
Tutte proved that if e is an element of a 3-connected matroid M such that neither M\e nor M/e is 3-c...
We show that for any 3-connected matroid M on a ground set of at least four elements such that M doe...
We prove that, for each nonnegative integer k and each matroid N, if M is a 3-connected matroid cont...
We prove that, for each nonnegative integer k and each matroid N, if M is a 3-connected matroid cont...
AbstractIn this paper we prove the following theorem: Let M be a 3-connected matroid other than the ...
AbstractA collection F of 3-connected matroids is triangle-rounded if, whenever M is a 3-connected m...
This paper proves that, for every integernexceeding two, there is a numberN(n) such that every 3-con...
A matroid is a mathematical object that generalizes and connects notions of independence that arise ...
AbstractIt is well known that a matroid is 2-connected if and only if every 2-element set is contain...
AbstractIt is well known that a matroid is 2-connected if and only if every 2-element set is contain...
AbstractA standard matrix representation A of a matroid M represents M relative to a fixed basis B. ...
AbstractIn this paper we prove the following theorem: Let M be a 3-connected matroid other than the ...
Matroid theory is the study of abstract properties of linear dependence. A matroid consists of a fin...
In combinatorics, a matroid is a discrete object that generalizes various notions of dependence that...
Connectivity is a fundamental tool for matroid theorists, which has become increasingly important in...
Tutte proved that if e is an element of a 3-connected matroid M such that neither M\e nor M/e is 3-c...
We show that for any 3-connected matroid M on a ground set of at least four elements such that M doe...
We prove that, for each nonnegative integer k and each matroid N, if M is a 3-connected matroid cont...
We prove that, for each nonnegative integer k and each matroid N, if M is a 3-connected matroid cont...
AbstractIn this paper we prove the following theorem: Let M be a 3-connected matroid other than the ...
AbstractA collection F of 3-connected matroids is triangle-rounded if, whenever M is a 3-connected m...
This paper proves that, for every integernexceeding two, there is a numberN(n) such that every 3-con...
A matroid is a mathematical object that generalizes and connects notions of independence that arise ...
DOI
Add to ORKG