1. Bollobás B: Random Graphs. New York: Academic Press, 1985
2. McDiarmid C., Miller Z.: Lattice bandwidth of random graphs. Discrete App. Math.30 221?227 (1991)
3. Erdös P., Szemerédi E.: Some recent combinatorial problems, preprint, 1990.
4. Hajnal A., Szemerédi E.: Proof of a conjecture of Erdös. In: Combinatorial Theory and its Applications, Vol. II (P. Erdös, A. Renyi and V.T. Sós eds.), Colloq. Math. Soc. J. Bolyai 4. (1970) pp. 601?623. Amsterdam: North Holland
5. Venkatesan R., Levin L.: Random instances of a graph coloring problem are hard. In: Proc. of the 20th AnnualSTOC, ACM Press. pp. 217?222 (1988)