Name
Abstract | ||
|---|---|---|
Let M be a loopless matroid on E with rank function rM. Let β(M)=max0̸≠X⊆E|X|rM(X) and φ(M)=minrM(X)<r(M)|E|−|X|rM(E)−rM(X). The Matroid Covering and Packing Theorems state that the minimum number of independent sets whose union is E is ⌈β(M)⌉, and the maximum number of disjoint bases is ⌊φ(M)⌋. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.1016/j.ejc.2018.09.010 | European Journal of Combinatorics |
Field | DocType | Volume |
Integer,Matroid,Discrete mathematics,Combinatorics,Disjoint sets,Mathematics | Journal | 76 |
ISSN | Citations | PageRank |
0195-6698 | 0 | 0.34 |
References | Authors | |
7 | 6 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Genghua Fan | 1 | 412 | 65.22 |
| Hongbi Jiang | 2 | 4 | 0.84 |
| Ping Li | 3 | 0 | 1.69 |
| Douglas B. West | 4 | 1176 | 185.69 |
| Daqing Yang | 5 | 67 | 6.31 |
| Xuding Zhu | 6 | 1883 | 190.19 |