Characterizing Matchings as the Intersection of Matroids
摘要
This paper deals with the problem of representing the matching independence system in a graph as the intersection of finitely many matroids. After characterizing the graphs for which the matching independence system is the intersection of two matroids, we study the function mu(G), which is the minimum number of matroids that need to be intersected in order to obtain the set of matchings on a graph G, and examine the maximal value, mu(n), for graphs with n vertices. We describe an integer programming formulation for deciding whether mu(G)<= k. Using combinatorial arguments, we prove that mu(n)is in Omega(loglog n). On the other hand, we establish that mu(n) is in O(log n / loglog n). Finally, we prove that mu(n)=4 for n=5,...,12, and mu(n)=5 for n=13,14,15.
引用
@article{arxiv.math/0212235,
title = {Characterizing Matchings as the Intersection of Matroids},
author = {Sandor P. Fekete and Robert T. Firla and Bianca Spille},
journal= {arXiv preprint arXiv:math/0212235},
year = {2007}
}
备注
12 pages, 1 figure; to appear in Mathematical Methods of Operations Research, added references