Name
Abstract | ||
|---|---|---|
A classical result of Dirac's shows that, for any two edges and any n−2 vertices in a simple n-connected graph, there is a cycle that contains both edges and all n−2 of the vertices. Oxley has asked whether, for any two elements and any n−2 cocircuits in an n-connected matroid, there is a circuit that contains both elements and that has a non-empty intersection with all n−2 of the cocircuits. By using Seymour's decomposition theorem and results of Oxley and Denley and Wu, we prove that a slightly stronger property holds for regular matroids. |
Year | DOI | Venue |
|---|---|---|
2006 | 10.1007/s00373-006-0677-9 | Graphs and Combinatorics |
Keywords | Field | DocType |
cocircuits,regular matroids,n-connected matroid,decomposition theorem,classical result,dirac,circuits,stronger property,non-empty intersection,simple n-connected graph | Matroid,Discrete mathematics,Graph,Combinatorics,Vertex (geometry),Decomposition theorem,Dirac (video compression format),Graphic matroid,Electronic circuit,Mathematics | Journal |
Volume | Issue | ISSN |
22 | 3 | 1435-5914 |
Citations | PageRank | References |
2 | 0.46 | 3 |
Authors | ||
1 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Dillon Mayhew | 1 | 102 | 18.63 |