An upper bound on the number of Steiner triple systems
From MaRDI portal
Publication:2868080
DOI10.1002/rsa.20487zbMath1278.05030arXiv1108.5042OpenAlexW2592640058MaRDI QIDQ2868080
Publication date: 23 December 2013
Published in: Random Structures & Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1108.5042
Related Items
On the maximum number of Latin transversals, Counting Steiner triple systems, The Existence of Designs via Iterative Absorption: Hypergraph 𝐹-designs for Arbitrary 𝐹, Upper bounds on the numbers of 1-factors and 1-factorizations of hypergraphs, Counting \(r\)-graphs without forbidden configurations, Almost all optimally coloured complete graphs contain a rainbow Hamilton path, Smoothed counting of 0–1 points in polyhedra, A proof of Tomescu's graph coloring conjecture, The number of \(n\)-queens configurations, Enumerating matroids and linear spaces, Permanents of multidimensional matrices: Properties and applications, Combinatorics, probability and computing. Abstracts from the workshop held April 24--30, 2022, On a conjecture of Erdős on locally sparse Steiner triple systems, Efficient, local and symmetric Markov chains that generate one-factorizations, Number of 1-factorizations of regular high-degree graphs, Thresholds versus fractional expectation-thresholds, On the numbers of 1-factors and 1-factorizations of hypergraphs, Enumerating extensions of mutually orthogonal Latin squares, An Entropy-Based Proof for the Moore Bound for Irregular Graphs, The number of partial Steiner systems and d-partitions, On the number of 1-factorizations of a complete graph
Cites Work
