Name
Abstract | ||
|---|---|---|
We prove that a binary matroid with huge branch-width contains the cycle matroid of a large grid as a minor. This implies that an infinite antichain of binary matroids cannot contain the cycle matroid of a planar graph. The result also holds for any other finite field. |
Year | DOI | Venue |
|---|---|---|
2007 | 10.1016/j.jctb.2007.02.005 | J. Comb. Theory, Ser. B |
Keywords | Field | DocType |
binary matroids,cycle matroid,matroids,finite field,representable matroids,planar graph,branch-width,infinite antichain,graph minors,binary matroid,large grid,huge branch-width,grids,graph minor | Matroid,Discrete mathematics,Wheel graph,Combinatorics,k-edge-connected graph,Matroid partitioning,Dual graph,Graphic matroid,Factor-critical graph,Mathematics,Branch-decomposition | Journal |
Volume | Issue | ISSN |
97 | 6 | Journal of Combinatorial Theory, Series B |
Citations | PageRank | References |
16 | 1.28 | 9 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jim Geelen | 1 | 241 | 29.49 |
| Bert Gerards | 2 | 146 | 14.47 |
| Geoff Whittle | 3 | 471 | 57.57 |