Persoon
Given a rank-r binary matroid we construct a system of $O(r^3)$ linear equations in $O(r^2)$ variables that has a solution over GF(2) if and only if the matroid is graphic.
For each finite field $F$ of prime order there is a constant $c$ such that every 4-connected matroid has at most $c$ inequivalent representations over $F$. We had hoped that this would extend to all finite fields, however, it was not to be. The $(m,n)$-mace is the matroid obtained by adding a point free
This paper contains a first step towards extending the Graph Minors Project of Robertson and Seymour to group-labelled graphs. For a finite abelian group Γ and Γ-labelled graph G, we describe the class of Γ-labelled graphs that do not contain a minor isomorphic to G.
A {\it $K_l$ -expansion} consists of $l$ vertex-disjoint trees, every two of which are joined by an edge. We call such an expansion {\it odd} if its vertices can be two-coloured so that the edges of the trees are bichromatic but the edges between trees are monochromatic. We show that, for every $l$,
A tangle in a matroid is an obstruction to small branch-width. In particular, the maximum order of a tangle is equal to the branch-width. We prove that: (i) there is a tree-decomposition of a matroid that “displays” all of the maximal tangles, and (ii) when M is representable over a finite field, eac
Omhoog
Ga terug naar de inhoud
Ga terug naar de site navigatie