13 search results - page 1 / 3 » The branchwidth of graphs and their cycle matroids |
JCT
2007
13 years 5 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...
JCT
2006
13 years 5 months ago
2006
Abstract. We introduce "matroid parse trees" which, using only a limited amount of information at each node, can build up the vector representations of matroids of bounde...
JCT
2007
13 years 5 months ago
2007
EJC
2006
13 years 5 months ago
2006
Abstract. We show that the tree-width of a graph can be defined without reference to graph vertices, and hence the notion of tree-width can be naturally extended to matroids. (This...
JCT
2002
13 years 5 months ago
2002
