Matroid lifts and representability
From MaRDI portal
Publication:6117419
DOI10.37236/12154arXiv2306.12543OpenAlexW4391258550WikidataQ129290275 ScholiaQ129290275MaRDI QIDQ6117419
Daniel Irving Bernstein, Zach Walsh
Publication date: 19 February 2024
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2306.12543
Cites Work
- Unnamed Item
- Partitionen endlicher Gruppen
- The circuit basis in binary matroids
- Biased graphs. II: The three matroids
- Partitions and other coverings of finite groups.
- A new matroid lift construction and an application to group-labeled graphs
- Dependencies among dependencies in matroids
- When does a biased graph come from a group labelling?
- Combinatorial derived matroids
- Non‐Algebraic Matroids exist
- Doubly Exponentially Many Ingleton Matroids
- Single-element extensions of matroids
- Theory of Matroids
This page was built for publication: Matroid lifts and representability