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...
Guardado en:
| Autor principal: | |
|---|---|
| Otros Autores: | , , , |
| Formato: | Artículo |
| Lenguaje: | English |
| Publicado: |
2022
|
| Materias: | |
| Acceso en línea: | https://doi.org/10.1007/s40590-022-00440-9 https://link.springer.com/article/10.1007/s40590-022-00440-9 |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
