Zsolt Fekete - Academia.edu (original) (raw)

Uploads

Papers by Zsolt Fekete

We say that a matroid M is k-uniform if – provided that it is the disjoint union of its two bases... more We say that a matroid M is k-uniform if – provided that it is the disjoint union of its two bases – for any given k-element subpartition P of its ground set, M can be partitioned into two disjoint bases B1, B2 such that ||B1 ∩ P | − |B2 ∩ P || ≤ 1 for all P ∈ P. The circuit matroid of an undirected graph G is called k-star-uniform if the above holds for all k-element subpartitions containing stars of independent vertices of G. In this paper we prove that the circuit matroids are 1-uniform and 3-star-uniform but not necessarily 2-uniform and 4-star-uniform.

Lecture Notes in Computer Science, 2006

We say that a matroid M is k-uniform if – provided that it is the disjoint union of its two bases... more We say that a matroid M is k-uniform if – provided that it is the disjoint union of its two bases – for any given k-element subpartition P of its ground set, M can be partitioned into two disjoint bases B1, B2 such that ||B1 ∩ P | − |B2 ∩ P || ≤ 1 for all P ∈ P. The circuit matroid of an undirected graph G is called k-star-uniform if the above holds for all k-element subpartitions containing stars of independent vertices of G. In this paper we prove that the circuit matroids are 1-uniform and 3-star-uniform but not necessarily 2-uniform and 4-star-uniform.

Lecture Notes in Computer Science, 2006

Log In