Count Matroids of Group-Labeled Graphs

Rintaro Ikeshita, Shin-ichi Tanigawa

A graph $G=(V,E)$ is called $(k,\ell )$-sparse if $|F|\le k|V(F)|-\ell$ for any nonempty $F\subseteq E$, where $V(F)$ denotes the set of vertices incident to $F$. It is known that…