A method to construct all the paving matroids over a finite set
We give a characterization of paving matroids through their sets of hyperplanes and an algorithm to construct all of them. We also give a simple proof of Rota’s basis conjecture for the case of sparse-paving matroids and for the case of paving matroids of rank rr on a set of cardinality n≤2rn≤2r, an...
Saved in:
| 主要作者: | |
|---|---|
| 其他作者: | , , , |
| 格式: | Artículo |
| 語言: | English |
| 出版: |
2022
|
| 主題: | |
| 在線閱讀: | https://doi.org/10.1007/s40590-022-00440-9 https://link.springer.com/article/10.1007/s40590-022-00440-9 |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
