Fetching the paper…
Reading the bibliography…
We prove the existence conjecture for combinatorial designs, answering a question of Steiner from 1853.
H. Hanani, The existence and construction of balanced incomplete block designs, Annals Math. Stat
1961
Earlier work this paper cites.
P. Erdős and H. Hanani, On a limit theorem in combinatorial analysis, Publicationes Mathematicae Debrecen
1963
Earlier work this paper cites.
H. Hanani, A balanced incomplete block design, Annals Math. Stat
1965
Earlier work this paper cites.
D. H. Gottlieb, A certain class of incidence matrices, Proc. Amer. Math. Soc
1966
Earlier work this paper cites.
K. Azuma, Weighted sums of certain dependent random variables, Tôhoku Math. J
1967
Earlier work this paper cites.
R. M. Wilson, An existence theory for pairwise balanced designs I. Composition theorems and morphisms, J. Combin. Theory Ser. A
1972
Earlier work this paper cites.
R. M. Wilson, An existence theory for pairwise balanced designs II. The structure of PBD-closed sets and the existence conjectures, J. Combin. Theory Ser. A
1972
Earlier work this paper cites.
J. E. Graver and W. B. Jurkat, The module structure of integral designs, J. Combin. Theory Ser. A
1973
Earlier work this paper cites.
R. M. Wilson, The necessary conditions for t-designs are sufficient for something, Utilitas Math
1973
Earlier work this paper cites.
D. A. Freedman, On tail probabilities for martingales, Ann. Probab
1975
Earlier work this paper cites.
R. M. Wilson, An existence theory for pairwise balanced designs III. Proof of the existence conjectures, J. Combin. Theory Ser. A
1975
Earlier work this paper cites.
P. Erdős, Problems and results in combinatorial analysis, Colloquio Internazionale sulle Teorie Combinatorie (Rome, 1973), Tomo II, Accad. Naz. Lincei, 1976, pp. 3–17. Atti dei Convegni Lincei, No. 17
1976
Earlier work this paper cites.
P. Frankl and V. Rödl, Near perfect coverings in graphs and hypergraphs, Europ. J. Combin
1985
Earlier work this paper cites.
V. Rödl, On a packing and covering problem, Europ. J. Combin
1985
Earlier work this paper cites.
L. Teirlinck, Non-trivial t-designs without repeated blocks exist for all t, Disc. Math
1987
Earlier work this paper cites.
N. Pippenger and J. H. Spencer, Asymptotic behaviour of the chromatic index for hypergraphs, J. Combin. Theory Ser. A
1989
Earlier work this paper cites.
T. Gustavsson, Decompositions of large graphs and digraphs with high minimum degree, Doctoral Dissertation, University of Stockholm, 1991
1991
Earlier work this paper cites.
N. Kuzjurin, On the difference between asymptotically good parkings and coverings, Europ. J. Combin
1995
Earlier work this paper cites.
J. Spencer, Asymptotic packing via a branching process, Random Struct. Alg
1995
Earlier work this paper cites.
J. Kahn, Asymptotically good list-colorings, J. Combin. Theory Ser. A
1996
Earlier work this paper cites.
N. Alon, J. H. Kim and J. Spencer, Nearly perfect matchings in regular simple hypergraphs, Israel J. Math
1997
Earlier work this paper cites.
J. Kahn and M. Kayll, On the stochastic independence properties of hardcore distributions, Combinatorica
1997
Earlier work this paper cites.
A. Kostochka and V. Rödl, Partial Steiner systems and matchings in hypergraphs, Random Struct. Alg
1997
Earlier work this paper cites.
C. McDiarmid, Concentration, in: Probabilistic Methods for Algorithmic Discrete Mathematics, Alg. Combin
1998
Earlier work this paper cites.
D. A. Grable, More-than-nearly perfect packings and partial designs, Combinatorica
1999
Earlier work this paper cites.
R. M. Wilson, Signed hypergraph designs and diagonal forms for some incidence matrices, Des. Codes Cryptogr
1999
Cited alongside, same era.
S. Janson, T. Łuczak and A. Ruciński, Random graphs
2000
Cited alongside, same era.
J. Kahn, A normal law for matchings, Combinatorica
2000
Cited alongside, same era.
V. Vu, New bounds on nearly perfect matchings in hypergraphs: higher codegrees do help, Random Struct. Alg
2000
Cited alongside, same era.
R. Wilson, The early history of block designs, Rend. del Sem. Mat. di Messina
2003
Cited alongside, same era.
P. Keevash and K. Staden, Ringel’s tree packing conjecture in quasirandom graphs, arXiv:2004.09947
2004
P. Keevash, Coloured and directed designs, Building Bridges II: Mathematics of László Lovász, Bolyai Society Mathematical Studies 28 (2019)
2019
Closest in time.
A. Lubotzky, Z. Luria and R. Rosenthal, Random Steiner systems and bounded degree coboundary expanders of every dimension Discrete Comp. Geom
2019
Closest in time.
R. Montgomery, Spanning trees in random graphs, Adv. Math
2019
Closest in time.
2020
Closest in time.
S. Glock, D. Kühn, A. Lo and D. Osthus, On a conjecture of Erdős on locally sparse Steiner triple systems, Combinatorica
2020
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
C. J. Colbourn and J. H. Dinitz, Handbook of Combinatorial Designs
2006
Cited alongside, same era.
J. Kahn and G. Kalai, Thresholds and expectation thresholds, Combin. Probab. Comput
2007
Cited alongside, same era.
V. Rödl, A. Ruciński and E. Szemerédi, Perfect matchings in large uniform hypergraphs with large minimum collective degree, J. Combin. Theory Ser. A 113:613–636 (2009)
2009
Cited alongside, same era.
V. Rödl and A. Ruciński, Dirac-type questions for hypergraphs — a survey (or more problems for Endre to solve), An Irregular Mind (Szemerédi is 70) 21:1–30 (2010)
2010
Cited alongside, same era.
M. Talagrand, Are many small sets explicitly small?, Proc. 42nd STOC
2010
Cited alongside, same era.
A. Barvinok and A. Samorodnitsky, Computing the partition function for perfect matchings in a hypergraph, Combin. Probab. Comput
2011
Cited alongside, same era.
2020
Closest in time.
K. Frankston, J. Kahn, B. Narayanan and J. Park, Thresholds versus fractional expectation-thresholds, Ann. Math
2021
Closest in time.
D. Gorenstein, R. Lyons and R. Solomon, The Classification of the Finite Simple Groups, Mathematical Surveys and Monographs 40, work in progress (1994–2021)
2021
Closest in time.
R. Montgomery, A. Pokrovskiy and B. Sudakov, A proof of Ringel’s conjecture, Geom. Funct. Analysis
2021
Closest in time.
2022
Closest in time.
2022
Closest in time.
P. Keevash and K. Staden, The generalised Oberwolfach problem, J. Combin. Theory Ser. B
2022
Closest in time.
M. Kwan, M. Sah and M. Sawhney, Large deviations in random latin squares, Bull. London. Math. Soc
2022
Closest in time.
A. Pokrovskiy, Rainbow Subgraphs and their Applications, Surveys in Combinatorics
2022
Closest in time.
A. Sah, M. Sawhney and M. Simkin, Threshold for Steiner triple systems, arXiv:2204.03964 (2022)
2022
Closest in time.
M. Simkin and Z. Luria, A Lower Bound for the n-queens Problem, Proc. SODA
2022
Closest in time.
2023
Closest in time.
D. Kang, T. Kelly, D. Kühn, A. Methuku and D. Osthus, Graph and hypergraph colouring via nibble methods: a survey, Proc. 8th ECM
2023
Closest in time.
D. Kang, T. Kelly, D. Kühn, A. Methuku and D. Osthus, A proof of the Erdős-Faber-Lovász conjecture, Annals Math
2023
Closest in time.
M. Simkin, The number of n n -queens configurations, Adv. Math
2023
Closest in time.
S. Glock, F. Joos, J. Kim, M. Kühn and L. Lichev, Conflict-free hypergraph matchings, J. Lond. Math. Soc
2024
Closest in time.
2024
Closest in time.
R. Montgomery, Transversals in Latin Squares, Surveys in Combinatorics
2024
Closest in time.