Interlacement and activities in delta-matroids
From MaRDI portal
Publication:2422209
DOI10.1016/j.ejc.2019.01.005zbMath1414.05069arXiv1710.10524OpenAlexW2962863574WikidataQ128494285 ScholiaQ128494285MaRDI QIDQ2422209
Publication date: 18 June 2019
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1710.10524
Matroids in convex geometry (realizations in the context of convex polytopes, convexity in combinatorial structures, etc.) (52B40) Combinatorial aspects of matroids and geometric lattices (05B35)
Related Items
Cites Work
- Unnamed Item
- Interlace polynomials for multimatroids and delta-matroids
- A quasi-tree expansion of the Krushkal polynomial
- Some combinatorial properties of discriminants in metric vector spaces
- Unimodularity and circle graphs
- Pseudomatroids
- Reducing prime graphs and recognizing circle graphs
- Representability of \(\bigtriangleup\)-matroids over \(GF(2)\)
- Circle graph obstructions
- A new proof of the Gauss interlace conjecture
- Non-orientable quasi-trees for the Bollobás-Riordan polynomial
- Maps and \(\Delta\)-matroids
- Quasi-tree expansion for the Bollobás-Riordan-Tutte polynomial
- Greedy algorithm and symmetric matroids
- Graphs on Surfaces
- On the interplay between embedded graphs and delta-matroids
- Multimatroids. III: Tightness and fundamental graphs
This page was built for publication: Interlacement and activities in delta-matroids