The number of partial Steiner systems and d-partitions
-
Published:2022-02-21
Issue:
Volume:
Page:
-
ISSN:2517-5599
-
Container-title:Advances in Combinatorics
-
language:en
-
Short-container-title:AiC
Author:
van der Hofstad Remco1,
Pendavingh Rudy1,
van der Pol Jorn2
Affiliation:
1. Eindhoven University of Technology
2. University of Waterloo
Abstract
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.
Publisher
Alliance of Diamond Open Access Journals
Subject
Discrete Mathematics and Combinatorics
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Enumerating Matroids and Linear Spaces;Comptes Rendus. Mathématique;2023-02-01