DeepAI AI Chat
Log In Sign Up

A Note on a Nearly Uniform Partition into Common Independent Sets of Two Matroids

by   Satoru Fujishige, et al.
National Institute of Informatics
Kyoto University
Hosei University

The present note is a strengthening of a recent paper by K. Takazawa and Y. Yokoi (A generalized-polymatroid approach to disjoint common independent sets in two matroids, Discrete Mathematics (2019)). For given two matroids on E, under the same assumption in their paper to guarantee the existence of a partition of E into k common independent sets of the two matroids, we show that there exists a nearly uniform partition P of E into k common independent sets, where the difference of the cardinalities of any two sets in P is at most one.


page 1

page 2

page 3

page 4


List colouring of two matroids through reduction to partition matroids

In the list colouring problem for two matroids, we are given matroids M_...

The Complexity of Finding Fair Independent Sets in Cycles

Let G be a cycle graph and let V_1,…,V_m be a partition of its vertex se...

On graphs admitting two disjoint maximum independent sets

An independent set A is maximal if it is not a proper subset of an indep...

A note on Cunningham's algorithm for matroid intersection

In the matroid intersection problem, we are given two matroids of rank r...

Uniform Approximation and Bracketing Properties of VC classes

We show that the sets in a family with finite VC dimension can be unifor...

Algorithms for weighted independent transversals and strong colouring

An independent transversal (IT) in a graph with a given vertex partition...

A Note on Generating Sets for Semiflows

In this short note, we are interested in discussing characteristics of f...