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...
Gorde:
| Egile nagusia: | |
|---|---|
| Beste egile batzuk: | , , , |
| Formatua: | Artículo |
| Hizkuntza: | English |
| Argitaratua: |
2022
|
| Gaiak: | |
| Sarrera elektronikoa: | https://doi.org/10.1007/s40590-022-00440-9 https://link.springer.com/article/10.1007/s40590-022-00440-9 |
| Etiketak: |
Etiketa erantsi
Etiketarik gabe, Izan zaitez lehena erregistro honi etiketa jartzen!
|
