1. M. Ajtai, J. Komlós, J. Pintz, J. Spencer and E. Szemerédi, Extremal Uncrowded Hypergraphs, Journal of Combinatorial Theory Ser. A, 32 (1982), 321–335.
2. N. Alon and J. Spencer, The Probabilistic Method, Wiley & Sons, New York (1992).
3. C. Bertram-Kretzberg and H. Lefmann, The Algorithmic Aspects of Uncrowded Hypergraphs, Proc. 8th ACM-SIAM Symposium on Discrete Algorithms SODA (1997), 296–304.
4. A. Fundia, Derandomizing Chebychev's Inequality to find Independent Sets in Uncrowded Hypergraphs, Random Structures & Algorithms, 8 (1996), 131–147.
5. J. Håstad, Clique is Hard to Approximate Within n
1−ε, Proc. 37th IEEE Symposium on Foundations of Computer Science FOGS (1996), 627–636.