B. Bollobas and P. Erd?-os, Cliques in random graphs, Math. Proc. Camb, pp.419-427, 1988.
DOI : 10.1017/S0305004100053056

A. M. Frieze, On the independence number of random graphs, Discrete Mathematics, vol.81, issue.2, pp.171-176, 1990.
DOI : 10.1016/0012-365X(90)90149-C

M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP- Completeness, 1978.

C. Lund and M. Yannakakis, The approximation of maximum subgraph problems, Proceedings of the 20th International Colloquium on Automata, Languages and Programming (ICALP'93), pp.40-51
DOI : 10.1007/3-540-56939-1_60

D. Matula, The largest clique size in a random graph, Tech. Rep., Dept. of Comp. Sci, 1976.

C. R. Subramanian, Finding induced acyclic subgraphs in random digraphs, The Electronic Journal of Combinatorics, vol.10, p.46, 2003.