Inductive tools for connected delta-matroids and multimatroids
From MaRDI portal
Publication:2357221
DOI10.1016/j.ejc.2017.02.005zbMath1365.05040arXiv1702.07179OpenAlexW2592278763MaRDI QIDQ2357221
Deborah Chun, Carolyn Chun, Steven D. Noble
Publication date: 19 June 2017
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1702.07179
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
Matroids, delta-matroids and embedded graphs, Irreducibility of the Tutte polynomial of an embedded graph
Cites Work
- Unnamed Item
- Unnamed Item
- Interlace polynomials for multimatroids and delta-matroids
- Partial duals of plane graphs, separability and the graphs of knots
- The group structure of pivot and loop complementation on graphs and set systems
- Separability and the genus of a partial dual
- Generalized duality for graphs on surfaces and the signed Bollobás-Riordan polynomial
- Representability of \(\bigtriangleup\)-matroids over \(GF(2)\)
- A note on the production of matroid minors
- Multimatroids. II: Orthogonality, minors and connectivity
- The linear delta-matroid parity problem
- Matroids, delta-matroids and embedded graphs
- Maps and \(\Delta\)-matroids
- Greedy algorithm and symmetric matroids
- Multimatroids I. Coverings by Independent Sets
- Graphs on Surfaces
- Nullity and Loop Complementation for Delta-Matroids
- Connectivity in Matroids
- A Decomposition for Combinatorial Geometries
- On the interplay between embedded graphs and delta-matroids
- Multimatroids. III: Tightness and fundamental graphs