Essential elements in connected k-polymatroids

It 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.

[1]  Geoff Whittle Duality in Polymatroids and Set Functions , 1992, Comb. Probab. Comput..

[2]  James G. Oxley,et al.  A Characterization of Tutte Invariants of 2-Polymatroids , 1993, J. Comb. Theory, Ser. B.

[3]  W. T. Tutte Connectivity in Matroids , 1966, Canadian Journal of Mathematics.

[4]  Frantisek Matús,et al.  Adhesivity of polymatroids , 2007, Discret. Math..

[5]  James G. Oxley,et al.  Some excluded-minor theorems for a class of polymatroids , 1993, Comb..

[6]  James G. Oxley,et al.  Matroid theory , 1992 .

[7]  James G. Oxley,et al.  Connectivity of submodular functions , 1992, Discret. Math..

[8]  William H. Cunningham,et al.  Decomposition of submodular functions , 1983, Comb..