Name
Abstract | ||
|---|---|---|
We prove that there is no polynomial $p(\cdot)$ with the property that a matroid $M$ can be determined to be either a lifted-graphic or frame matroid using at most $p(|M|)$ rank evaluations. This resolves two conjectures of Geelen, Gerards and Whittle (Quasi-graphic matroids, arXiv:1512.03005v1). |
Year | Venue | Field |
|---|---|---|
2018 | Journal of Graph Theory | Matroid,Discrete mathematics,Combinatorics,k-edge-connected graph,Oriented matroid,Matroid partitioning,Graphic matroid,Circuit rank,Weighted matroid,Mathematics,Branch-decomposition |
DocType | Volume | Issue |
Journal | 87 | 1 |
Citations | PageRank | References |
1 | 0.39 | 2 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Rong Chen | 1 | 5 | 3.96 |
| Geoff Whittle | 2 | 471 | 57.57 |