1. Ahlswede R., Gâcs P. and Körner J. (1976): Bounds on conditional probabilities with applications in multi-user communication, Z. Wahrscheinlichkeitstheorie verw. Geb. 34, 157–177. (Erratum (1977) 39, 353–354.)
2. Alon N., Kim J.H. and Spencer J. (1997): Nearly perfect matchings in regular simple hypergraphs, Israel J. Math. 100, 171–188.
3. Alon N. and Spencer N. (1992): The Probabilistic Method, John Wiley Sons.
4. Angluin D. and Valiant L. (1979): Fast probabilistic algorithms for Hamiltonian circuits and matchings, J. Computer and System Sciences 18, 155–193.
5. Avram F. and Bertsimas D. (1992): The minimum spanning tree constant in geometrical probability and under the independent model: a unified approach, Annals of Applied Probability 2, 113–130.