In this paper, we investigate the classes of matroid intersection admitting a solution for the problem of partitioning the ground set into common independent sets, where can be partitioned into 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 -spanned elements. Moreover, we newly show that the intersection of a laminar matroid and a matroid without -spanned elements admits a solution. We also construct an example of a transversal matroid which is incompatible with the generalized-polymatroid approach.

生成讲解博客的中文版本

生成AI智能校验的中文版本