pith. sign in

arxiv: 1805.05528 · v3 · pith:XAHA7EQVnew · submitted 2018-05-15 · 🧮 math.CO

A Generalized-Polymatroid Approach to Disjoint Common Independent Sets in Two Matroids

classification 🧮 math.CO
keywords approachintersectionmatroidmatroidsgeneralized-polymatroidindependentproblemsets
0
0 comments X
read the original abstract

In this paper, we investigate the classes of matroid intersection admitting a solution for the problem of partitioning the ground set $E$ into $k$ common independent sets, where $E$ can be partitioned into $k$ independent sets in each of the two matroids. For this problem, we present a new approach building upon the generalized-polymatroid intersection theorem. We exhibit that this approach offers alternative proofs and unified understandings of previous results showing that the problem has a solution for the intersection of two laminar matroids and that of two matroids without $(k+1)$-spanned elements. Moreover, we newly show that the intersection of a laminar matroid and a matroid without $(k+1)$-spanned elements admits a solution. We also construct an example of a transversal matroid which is incompatible with the generalized-polymatroid approach.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.