Counting designs
Journal of the European Mathematical Society, Tome 20 (2018) no. 4, pp. 903-927
Voir la notice de l'article provenant de la source EMS Press
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.
Peter Keevash. Counting designs. Journal of the European Mathematical Society, Tome 20 (2018) no. 4, pp. 903-927. doi: 10.4171/jems/779
@article{JEMS_2018_20_4_a2,
author = {Peter Keevash},
title = {Counting designs},
journal = {Journal of the European Mathematical Society},
pages = {903--927},
year = {2018},
volume = {20},
number = {4},
doi = {10.4171/jems/779},
url = {http://geodesic.mathdoc.fr/articles/10.4171/jems/779/}
}
Cité par Sources :