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

09/29/2019
by   Satoru Fujishige, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/24/2019

List colouring of two matroids through reduction to partition matroids

In the list colouring problem for two matroids, we are given matroids M_...
research
11/03/2020

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...
research
07/18/2018

On graphs admitting two disjoint maximum independent sets

An independent set A is maximal if it is not a proper subset of an indep...
research
04/08/2019

A note on Cunningham's algorithm for matroid intersection

In the matroid intersection problem, we are given two matroids of rank r...
research
06/19/2023

An Isotonic Mechanism for Overlapping Ownership

This paper extends the Isotonic Mechanism from the single-owner to multi...
research
07/23/2010

Uniform Approximation and Bracketing Properties of VC classes

We show that the sets in a family with finite VC dimension can be unifor...
research
11/18/2022

A Note on Generating Sets for Semiflows

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

Please sign up or login with your details

Forgot password? Click here to reset