AbstractIt is a well-known result of Tutte that, for every element x of a connected matroid M, at least one of the deletion and contraction of x from M is connected. This paper shows that, in a connected k-polymatroid, only two such elements are guaranteed. We show that this bound is sharp and characterize those 2-polymatroids that achieve this minimum. To this end, we define and make use of a generalized parallel connection for k-polymatroids that allows connecting across elements of different ranks. This study of essential elements gives results crucial to finding the unavoidable minors of connected 2-polymatroids, which will appear elsewhere
AbstractIt is well known that a matroid is 2-connected if and only if every 2-element set is contain...
By a well-known result of Tutte, if e is an element of a connected matroid M, then either the deleti...
AbstractLet n be an integer exceeding one and M be a matroid having at least n + 2 elements. In this...
AbstractBy a well-known result of Tutte, if e is an element of a connected matroid M, then either th...
Matroids were introduced in 1935 by Hassler Whitney to provide a way to abstractly capture the depen...
An essential element of a 3-connected matroid M is one for which neither the deletion nor the contra...
Connectivity is a fundamental tool for matroid theorists, which has become increasingly important in...
AbstractAn element e of a 3-connected matroid M is essential if neither the deletion nor the contrac...
Abstract. An element e of a 3–connected matroid M is essential if neither the deletion nor the contr...
AbstractA matroid M is minimally k-connected if M is k-connected and, for every e∈E(M), M\e is not k...
AbstractA connected matroid M is called a critically connected matroid if the deletion of any one el...
Let n be an integer exceeding one and M be a matroid having at least n + 2 elements. In this paper, ...
An element e of a 3--connected matroid M is essential if neither the deletion Mne nor the contractio...
AbstractAn element e of a 3 -connected matroid M is essential if neither the deletionM\e nor the con...
A sufficiently large connected matroid M contains a big circuit or a big cocircuit. Wu showed that w...
AbstractIt is well known that a matroid is 2-connected if and only if every 2-element set is contain...
By a well-known result of Tutte, if e is an element of a connected matroid M, then either the deleti...
AbstractLet n be an integer exceeding one and M be a matroid having at least n + 2 elements. In this...
AbstractBy a well-known result of Tutte, if e is an element of a connected matroid M, then either th...
Matroids were introduced in 1935 by Hassler Whitney to provide a way to abstractly capture the depen...
An essential element of a 3-connected matroid M is one for which neither the deletion nor the contra...
Connectivity is a fundamental tool for matroid theorists, which has become increasingly important in...
AbstractAn element e of a 3-connected matroid M is essential if neither the deletion nor the contrac...
Abstract. An element e of a 3–connected matroid M is essential if neither the deletion nor the contr...
AbstractA matroid M is minimally k-connected if M is k-connected and, for every e∈E(M), M\e is not k...
AbstractA connected matroid M is called a critically connected matroid if the deletion of any one el...
Let n be an integer exceeding one and M be a matroid having at least n + 2 elements. In this paper, ...
An element e of a 3--connected matroid M is essential if neither the deletion Mne nor the contractio...
AbstractAn element e of a 3 -connected matroid M is essential if neither the deletionM\e nor the con...
A sufficiently large connected matroid M contains a big circuit or a big cocircuit. Wu showed that w...
AbstractIt is well known that a matroid is 2-connected if and only if every 2-element set is contain...
By a well-known result of Tutte, if e is an element of a connected matroid M, then either the deleti...
AbstractLet n be an integer exceeding one and M be a matroid having at least n + 2 elements. In this...