Name
Abstract | ||
|---|---|---|
Let Un,r be a uniform oriented matroid having as bases, B, all r-subsets (resp. as circuits, C, all (r+1)-subsets) of {1,…,n}. We say that C1⊆C is a covering, of Un,r, if for any base B∈B there is a circuit C∈C1 such that B⊂C. Let G(C1) be the graph having as set of vertices the elements of C1 and where two vertices are joined if they have one base in common. We say that C1⊆C is a connected covering if C1 is a covering and G(C1) is connected. It is easy to show that if a covering is connected then it completely determines Un,r. In this note, we show that connectivity is not always necessary. |
Year | DOI | Venue |
|---|---|---|
2002 | 10.1016/S0012-365X(02)00536-8 | Discrete Mathematics |
Keywords | Field | DocType |
oriented matroid | Matroid,Discrete mathematics,Graph,Combinatorics,Vertex (geometry),Oriented matroid,Graphic matroid,Mathematics | Journal |
Volume | Issue | ISSN |
258 | 1 | 0012-365X |
Citations | PageRank | References |
1 | 0.35 | 1 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| D. Forge | 1 | 2 | 0.75 |
| J.L. Ramı́rez Alfonsı́n | 2 | 3 | 0.83 |
| H. Yeun | 3 | 1 | 0.35 |