arXiv Analytics

Sign in

arXiv:2202.07719 [math.CO]AbstractReferencesReviewsResources

Matchings in matroids over abelian groups

Mohsen Aliabadi, Shira Zerbib

Published 2022-02-15Version 1

We formulate and prove matroid analogues of results concerning matchings in groups. A matching in an abelian group $(G,+)$ is a bijection $f:A\to B$ between two finite subsets $A,B$ of $G$ satisfying $a+f(a)\notin A$ for all $a\in A$. A group $G$ has the matching property if for every two finite subsets $A,B \subset G$ of the same size with $0 \notin B$, there exists a matching from $A$ to $B$. In [19] it was proved that an abelian group has the matching property if and only if it is torsion-free or cyclic of prime order. Here we consider a similar question in a matroid setting. We introduce an analogous notion of matching between matroids whose ground sets are subsets of an abelian group $G$, and we obtain criteria for the existence of such matchings. Our tools are classical theorems in matroid theory, group theory and additive number theory.

Comments: Comments are welcome
Categories: math.CO
Related articles: Most relevant | Search more
arXiv:2412.04516 [math.CO] (Published 2024-12-05)
Matchings in matroids over abelian groups, II
arXiv:math/0307142 [math.CO] (Published 2003-07-10, updated 2004-11-18)
Sum-free sets in abelian groups
arXiv:2001.03916 [math.CO] (Published 2020-01-12)
On the existence and the enumeration of bipartite regular representations of Cayley graphs over abelian groups