On Matroid Representability and Minor Problems
From MaRDI portal
Recommendations
Cited in
(18)- On graphic matroid minors that guarantee their duals as minors
- The matroid structure of representative triple sets and triple-closure computation
- A short proof of non-GF(5)-representability of matroids
- On the complex-representable excluded minors for real-representability
- Undecidability of \(c\)-arrangement matroid representations
- Lindström's conjecture on a class of algebraically non-representable matroids
- Representability of matroids by c-arrangements is undecidable
- Complexity of testing reachability in matroids
- First order convergence of matroids
- scientific article; zbMATH DE number 4145914 (Why is no real title available?)
- Computing Representations of Matroids of Bounded Branch-Width
- Matroid Pathwidth and Code Trellis Complexity
- Matroid Complexity and Nonsuccinct Descriptions
- scientific article; zbMATH DE number 3970763 (Why is no real title available?)
- Decomposition width of matroids
- Theta rank, levelness, and matroid minors
- On the complexity of matroid isomorphism problem
- Representing matroids over the reals is \(\exists \mathbb{R}\)-complete
This page was built for publication: On Matroid Representability and Minor Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5756699)