A new matroid lift construction and an application to group-labeled graphs

DOI10.37236/10372zbMath1481.05026arXiv2104.08257OpenAlexW4210784789MaRDI QIDQ2073295

Zach Walsh

Publication date: 1 February 2022

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2104.08257

zbMATH Keywords

group-labeled graphsZaslavsky's lift matroid

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items

Matroid lifts and representability

Cites Work

• Unnamed Item
• Unnamed Item
• Biased graphs. I: Bias, balance, and gains
• Partitionen endlicher Gruppen
• On a finite group with a partition
• The circuit basis in binary matroids
• Biased graphs. II: The three matroids
• Dependencies among dependencies in matroids
• When does a biased graph come from a group labelling?
• A class of geometric lattices based on finite groups
• Nicht-einfache Partitionen endlicher Gruppen
• Single-element extensions of matroids