Name
Abstract | ||
|---|---|---|
. Let N be a restriction of a 3-connected matroid M and let M
′ be a 3-connected minor of M that is minimal having N as a restriction. This paper gives a best-possible upper bound on |E(M
′)−E(N)|. |
Year | DOI | Venue |
|---|---|---|
2000 | 10.1007/PL00007223 | Graphs and Combinatorics |
Keywords | Field | DocType |
upper bound | Matroid,Topology,Discrete mathematics,Combinatorics,Upper and lower bounds,Mathematics | Journal |
Volume | Issue | ISSN |
16 | 3 | 0911-0119 |
Citations | PageRank | References |
3 | 0.51 | 6 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Manoel Lemos | 1 | 83 | 19.44 |
| James Oxley | 2 | 194 | 24.39 |
| Talmage James Reid | 3 | 48 | 12.18 |