Count matroids of group-labeled graphs (Q1715073): Difference between revisions

A graph $G=(V,E)$ is $(k,\ell)$-sparse whenever $\vert F\vert \leq k \vert \bigcup_{e \in F} e\vert - \ell$ for each nonempty $F \subseteq E$. Edge sets of the $(k,\ell)$-sparse subgraphs form the independent sets of the $(k,\ell)$-count matroid. This paper examines lifts of $(k,\ell)$-count matroids using labelings of the edges of the graph by group elements. A novel condition on `near-balancedness' then underlies the determination of a class of matroids whose independent sets satisfy a count condition determined by the group labeling. Among the class of matroids developed in this way are examples in which matroidal structure had not been earlier established.