Random methods in design theory: A survey

DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1520-6610(1996)4:4<255::AID-JCD4>3.0.CO;2-E" /><255::AID-JCD4>3.0.CO;2-E 10.1002/(SICI)1520-6610(1996)4:4<255::AID-JCD4>3.0.CO;2-EzbMath0911.05028OpenAlexW2132680686MaRDI QIDQ4222120

Kevin T. Phelps, David A. Grable

Publication date: 6 December 1998

Full work available at URL: https://doi.org/10.1002/(sici)1520-6610(1996)4:4<255::aid-jcd4>3.0.co;2-e

zbMATH Keywords

random methodsopen problemsdesign theory

Mathematics Subject Classification ID

Hypergraphs (05C65) Other designs, configurations (05B30) Triple systems (05B07) Designs and configurations (05B99)

Related Items (4)

On the number of partial Steiner systems ⋮ Asymptotic enumeration of linear hypergraphs with given number of vertices and edges ⋮ On the number of linear multipartite hypergraphs with given size ⋮ Asymptotic enumeration of non-uniform linear hypergraphs

This page was built for publication: Random methods in design theory: A survey