Name
Abstract | ||
|---|---|---|
We give a lower bound on the number of edges meeting some vertex of degree k in terms of the total number of edges in a minimally k-connected graph. This lower bound is tight if k is two or three. The extremal graphs in the case that k =2 are characterized. We also give a lower bound on the number of elements meeting some 2-element cocircuit in terms of the total number of elements in a minimally 2-connected matroid. This lower bound is tight and the extremal matroids are characterized. |
Year | DOI | Venue |
|---|---|---|
2002 | 10.1016/S0012-365X(01)00220-5 | Discrete Mathematics |
Keywords | Field | DocType |
small cocircuits,minimally k-connected graph,lower bound,connected graph | Graph theory,Matroid,Discrete mathematics,Graph,Combinatorics,Vertex (geometry),k-edge-connected graph,Upper and lower bounds,Graphic matroid,Connectivity,Mathematics | Journal |
Volume | Issue | ISSN |
243 | 1-3 | Discrete Mathematics |
Citations | PageRank | References |
3 | 0.49 | 0 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Talmage James Reid | 1 | 48 | 12.18 |
| Haidong Wu | 2 | 26 | 8.43 |