Name
Abstract | ||
|---|---|---|
Let N be a minor of a 3-connected matroid M and let M′ be a 3-connected minor of M that is minimal having N as a minor. This paper commences the study of the problem of finding a best-possible upper bound on |E(M′)−E(N)| . The main result solves this problem in the case that N and M have the same rank. |
Year | DOI | Venue |
|---|---|---|
2000 | 10.1016/S0012-365X(99)00344-1 | Discrete Mathematics |
Keywords | Field | DocType |
matroid,3-connected matriods,minor,3-connected,extremal connectivity result,05b35,restriction,upper bound | Matroid,Discrete mathematics,Combinatorics,Upper and lower bounds,Matroid partitioning,Mathematics | Journal |
Volume | Issue | ISSN |
218 | 1-3 | Discrete Mathematics |
Citations | PageRank | References |
4 | 0.65 | 0 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Manoel Lemos | 1 | 83 | 19.44 |
| James Oxley | 2 | 194 | 24.39 |