1942 search results - page 1 / 389 » Matroids from modules |
ENTCS
2002
13 years 10 months ago
2002
The aim of this work is to show that (oriented) matroid methods can be applied to many discrete geometries, namely those based on modules over integral (ordered) domains. The tric...
SIAMDM
2011
13 years 5 months ago
2011
Seymour’s Decomposition Theorem for regular matroids states that any matroid representable over both GF(2) and GF(3) can be obtained from matroids that are graphic, cographic, o...
JCT
2007
13 years 10 months ago
2007
Abstract. We prove that a binary matroid with huge branchwidth contains the cycle matroid of a large grid as a minor. This implies that an infinite antichain of binary matroids ca...
CSR
2009
Springer
14 years 5 months ago
2009
Springer
We study the complexity of testing if two given matroids are isomorphic. The problem is easily seen to be in Σp 2 . In the case of linear matroids, which are represented over poly...
MST
2011
13 years 1 months ago
2011
We study the complexity of testing if two given matroids are isomorphic. The problem is easily seen to be in Σ p 2. In the case of linear matroids, which are represented over pol...