Geodesic
The number of partial Steiner systems and $d$-partitions
Advances in Combinatorics (2022) Cet article a éte moissonné depuis la source Scholastica

Voir la notice de l'article

We prove asymptotic upper bounds on the number of $d$-partitions (paving matroids of fixed rank) and partial Steiner systems (sparse paving matroids of fixed rank), using a mixture of entropy counting, sparse encoding, and the probabilistic method.
Publié le : 
@article{ADVC_2022_a7,
     author = {Remco van der Hofstad and Rudi Pendavingh and Jorn van der Pol},
     title = {The number of partial {Steiner} systems and $d$-partitions},
     journal = {Advances in Combinatorics},
     year = {2022},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/ADVC_2022_a7/}
}
TY  - JOUR
AU  - Remco van der Hofstad
AU  - Rudi Pendavingh
AU  - Jorn van der Pol
TI  - The number of partial Steiner systems and $d$-partitions
JO  - Advances in Combinatorics
PY  - 2022
UR  - http://geodesic.mathdoc.fr/item/ADVC_2022_a7/
LA  - en
ID  - ADVC_2022_a7
ER  - 
%0 Journal Article
%A Remco van der Hofstad
%A Rudi Pendavingh
%A Jorn van der Pol
%T The number of partial Steiner systems and $d$-partitions
%J Advances in Combinatorics
%D 2022
%U http://geodesic.mathdoc.fr/item/ADVC_2022_a7/
%G en
%F ADVC_2022_a7
Remco van der Hofstad; Rudi Pendavingh; Jorn van der Pol. The number of partial Steiner systems and $d$-partitions. Advances in Combinatorics (2022). http://geodesic.mathdoc.fr/item/ADVC_2022_a7/