Count matroids of group-labeled graphs
- First Online:
- 8 Downloads
A graph G = (V, E) is called (k, ℓ)-sparse if |F| ≤ k|V (F)| − ℓ for any nonempty F ⊆ E, where V (F) denotes the set of vertices incident to F. It is known that the family of the edge sets of (k, ℓ)-sparse subgraphs forms the family of independent sets of a matroid, called the (k, ℓ)-count matroid of G. In this paper we shall investigate lifts of the (k, ℓ)- count matroids by using group labelings on the edge set. By introducing a new notion called near-balancedness, we shall identify a new class of matroids whose independence condition is described as a count condition of the form |F| ≤ k|V (F)|−ℓ+αψ (F) for some function αψ determined by a given group labeling ψ on E.
Mathematics Subject Classification (2000)05B35 52C25
Unable to display preview. Download preview PDF.
- A. Berg and T. Jordán: Algorithms for graph rigidity and scene analysis, Proc. 11th Annual European Symposium on Algorithms (ESA), LNCS 2832, (2003), 78–89.Google Scholar
- J. Edmonds: Submodular functions, matroids, and certain polyhedra, in: Combinatorial Structures and Their Applications (R. Guy, H. Hanani, N. Sauer, and J. Schönheim, eds.), (1970), 69–87.Google Scholar
- R. Ikeshita: Infinitesimal rigidity of symmetric frameworks, Master Thesis, University of Tokyo, (2015).Google Scholar
- E. Ross: Geometric and combinatorial rigidity of periodic frameworks as graphs on the torus, Ph.D. thesis, York University, Toronto, (2011).Google Scholar