AbstractLet N be a minor of a 3-connected matroid M and let M′ be a 3-connected minor of M that is minimal having N as a minor. This paper commences the study of the problem of finding a best-possible upper bound on |E(M′)−E(N)|. The main result solves this problem in the case that N and M have the same rank
For a matroid N, a matroid M is N-connected if every two elements of M are in an N-minor together. T...
AbstractIt is well known that a matroid is 2-connected if and only if every 2-element set is contain...
AbstractWhittle proved, for k=1,2, that if N is a 3-connected minor of a 3-connected matroid M, sati...
Let N be a minor of a 3-connected matroid M and let M′ be a 3-connected minor of M that is minimal h...
AbstractLet N be a minor of a 3-connected matroid M such that no proper 3-connected minor of M has N...
Let N be a minor of a 3-connected matroid M such that no proper 3-connected minor of M has N as a mi...
AbstractLet N be a minor of a 3-connected matroid M and let M′ be a 3-connected minor of M that is m...
Let N be a matroid with k connected components and M be a minor-minimal connected matroid having N a...
Let N be a restriction of a 3-connected matroid M and let M′ be a 3-connected minor of M that is min...
AbstractLet M1,M2,…,Mn be 3-connected restrictions of a 3-connected matroid M on disjoint ground set...
Let N be a restriction of a 3-connected matroid M and let M 0 be a 3-connected minor of M that is ...
This paper proves several extremal results for 3-connected matroids. In particular, it is shown that...
Abstract. Let N be a minor of a 3-connected matroid M such that no proper 3-connected minor of M has...
We prove that, for each nonnegative integer k and each matroid N, if M is a 3-connected matroid cont...
AbstractA matroid M is called minor-minimally 3-connected if M is 3-connected and, for each e∈E(M), ...
For a matroid N, a matroid M is N-connected if every two elements of M are in an N-minor together. T...
AbstractIt is well known that a matroid is 2-connected if and only if every 2-element set is contain...
AbstractWhittle proved, for k=1,2, that if N is a 3-connected minor of a 3-connected matroid M, sati...
Let N be a minor of a 3-connected matroid M and let M′ be a 3-connected minor of M that is minimal h...
AbstractLet N be a minor of a 3-connected matroid M such that no proper 3-connected minor of M has N...
Let N be a minor of a 3-connected matroid M such that no proper 3-connected minor of M has N as a mi...
AbstractLet N be a minor of a 3-connected matroid M and let M′ be a 3-connected minor of M that is m...
Let N be a matroid with k connected components and M be a minor-minimal connected matroid having N a...
Let N be a restriction of a 3-connected matroid M and let M′ be a 3-connected minor of M that is min...
AbstractLet M1,M2,…,Mn be 3-connected restrictions of a 3-connected matroid M on disjoint ground set...
Let N be a restriction of a 3-connected matroid M and let M 0 be a 3-connected minor of M that is ...
This paper proves several extremal results for 3-connected matroids. In particular, it is shown that...
Abstract. Let N be a minor of a 3-connected matroid M such that no proper 3-connected minor of M has...
We prove that, for each nonnegative integer k and each matroid N, if M is a 3-connected matroid cont...
AbstractA matroid M is called minor-minimally 3-connected if M is 3-connected and, for each e∈E(M), ...
For a matroid N, a matroid M is N-connected if every two elements of M are in an N-minor together. T...
AbstractIt is well known that a matroid is 2-connected if and only if every 2-element set is contain...
AbstractWhittle proved, for k=1,2, that if N is a 3-connected minor of a 3-connected matroid M, sati...