Count Matroids of Group-Labeled Graphs
Sign Up to like & getrecommendations! Published in 2018 at "Combinatorica"
DOI: 10.1007/s00493-016-3469-8
Abstract: 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… read more here.
Keywords: matroids group; group; labeled graphs; count matroids ... See more keywords