Counting designs
From MaRDI portal
Abstract: We give estimates on the number of combinatorial designs, which prove (and generalise) a conjecture of Wilson from 1974 on the number of Steiner Triple Systems. This paper also serves as an expository treatment of our recently developed method of Randomised Algebraic Construction: we give a simpler proof of a special case of our result on clique decompositions of hypergraphs, namely triangle decompositions of quasirandom graphs.
Recommendations
Cited in
(59)- Enumerating matroids and linear spaces
- Perfect Packings in Quasirandom Hypergraphs II
- Codegree conditions for tiling complete \(k\)-partite \(k\)-graphs and loose cycles
- On the maximum number of Latin transversals
- Combinatorics. Abstracts from the workshop held January 1--7, 2023
- On extremal hypergraphs for forests of tight paths
- Hypercycle systems
- Local balance in graph decompositions
- Shattering and more: Extending the complete object
- Decompositions of quasirandom hypergraphs into hypergraphs of bounded degree
- Steiner loops of affine type
- Minimalist designs
- Random Steiner systems and bounded degree coboundary expanders of every dimension
- On tight 9-cycle decompositions of complete 3-uniform hypergraphs
- Enumerating coprime permutations
- Hamilton transversals in random Latin squares
- The number of \(n\)-queens configurations
- An upper bound on the number of Steiner triple systems
- Maximum packings of the \(\lambda\)-fold complete 3-uniform hypergraph with loose 3-cycles
- Upper bounds on the sizes of variable strength covering arrays using the Lovász local lemma
- Thresholds versus fractional expectation-thresholds
- The Existence of Designs via Iterative Absorption: Hypergraph 𝐹-designs for Arbitrary 𝐹
- A rainbow blow-up lemma for almost optimally bounded edge-colourings
- Counting Steiner triple systems
- Constructions and uses of incomplete pairwise balanced designs
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems
- Pseudorandom hypergraph matchings
- The triangle-free process and the Ramsey number \(R(3,k)\)
- Coloured and directed designs
- A Short proof of the blow-up lemma for approximate decompositions
- Substructures in Latin squares
- Perfectly packing graphs with bounded degeneracy and many leaves
- Counting \(r\)-graphs without forbidden configurations
- On a problem of Erdős and Moser
- Resolution of the Oberwolfach problem
- The number of partial Steiner systems and d-partitions
- On a conjecture of Erdős on locally sparse Steiner triple systems
- scientific article; zbMATH DE number 7283879 (Why is no real title available?)
- Hypergraphs without non-trivial intersecting subgraphs
- Large deviations in random latin squares
- The first families of highly symmetric Kirkman triple systems whose orders fill a congruence class
- Almost all optimally coloured complete graphs contain a rainbow Hamilton path
- Enumerating matroids of fixed rank
- Existence of \(q\)-analogs of Steiner systems
- Large girth approximate Steiner triple systems
- Bounding the independence number in some \((n,k,\ell,\lambda)\)-hypergraphs
- Decompositions of edge-colored digraphs: a new technique in the construction of constant-weight codes and related families
- Almost all Steiner triple systems are almost resolvable
- Smoothed counting of 0–1 points in polyhedra
- Large sets with multiplicity
- Euler tours in hypergraphs
- Threshold for Steiner triple systems
- Constructing random Steiner triple systems: an experimental study
- scientific article; zbMATH DE number 7731175 (Why is no real title available?)
- Euler's theorem for regular CW-complexes
- Algorithms and complexity for counting configurations in Steiner triple systems
- Graph and hypergraph packing
- Combinatorics, probability and computing. Abstracts from the workshop held April 24--30, 2022
- Matroid Horn functions
This page was built for publication: Counting designs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1746198)
