The number of partial Steiner systems and d-partitions

DOI10.19086/aic.32563zbMath1506.05044arXiv1811.11810v4OpenAlexW4211188848MaRDI QIDQ5871278

Jorn G. Van der Pol, Remco van der Hofstad, Rudi A. Pendavingh

Publication date: 18 January 2023

Published in: Advances in Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1811.11810v4

zbMATH Keywords

entropydesignSteiner systemsmatroidsasymptotic enumerationtriple systemspaving matroid\(d\)-partition

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Combinatorial aspects of matroids and geometric lattices (05B35) Asymptotic enumeration (05A16) Triple systems (05B07)

Related Items (2)

Enumerating matroids and linear spaces ⋮ Combinatorics, probability and computing. Abstracts from the workshop held April 24--30, 2022

Cites Work

• Unnamed Item
• Unnamed Item
• On the number of matroids compared to the number of sparse paving matroids
• Enumerating matroids of fixed rank
• Counting designs
• On the asymptotic proportion of connected matroids
• An upper bound on the number of Steiner triple systems
• Lattice Theory of Generalized Partitions
• On the Foundations of Combinatorial Theory II. Combinatorial Geometries

This page was built for publication: The number of partial Steiner systems and d-partitions