N. Alon and J. H. Spencer, The Probabilistic Method, 2001.

B. Bollobás, Random Graphs, 2001.

M. Cai, X. Deng, and Z. W. , An Approximation Algorithm for Feedback Vertex Sets in Tournaments, SIAM Journal on Computing, vol.30, issue.6, 1993.
DOI : 10.1137/S0097539798338163

R. W. Floyd, Assigning meaning to programs, Proc. Symp, pp.19-32, 1967.

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

N. Kahale and L. J. Schulman, Bounds on the chromatic polynomial and on the number of acyclic orientations of a graph, Combinatorica, vol.3, issue.No. 4, pp.16-383, 1996.
DOI : 10.1007/BF01261322

M. Krivelevich and B. Sudakov, Coloring random graphs, Information Processing Letters, vol.67, issue.2, pp.71-74, 1998.
DOI : 10.1016/S0020-0190(98)00092-1

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, 1993.
DOI : 10.1007/3-540-56939-1_60

U. Manber and M. Tompa, The Effect of Number of Hamiltonian Paths on the Complexity of a Vertex-Coloring Problem, SIAM Journal on Computing, vol.13, issue.1, pp.109-115, 1984.
DOI : 10.1137/0213008

R. Motwani and P. Raghavan, Randomized Algorithms, 1995.

V. Raman and S. Saurabh, Parameterized algorithms for feedback set problems and their duals in tournaments, Theoretical Computer Science, vol.351, issue.3, pp.446-458, 2006.
DOI : 10.1016/j.tcs.2005.10.010

B. K. Rosen, Robust linear algorithms for cutsets, Journal of Algorithms, vol.3, issue.3, 1982.
DOI : 10.1016/0196-6774(82)90020-7

E. Shamir and J. Spencer, Sharp concentration of the chromatic number on random graphsG n, p, Combinatorica, vol.5, issue.1, pp.121-129, 1987.
DOI : 10.1007/BF02579208

E. Speckenmeyer, On feedback problems in digraphs, Proceedings of 15th International Workshop on Graph Theoretic Concepts in Computer Science (WG'89), pp.218-231, 1989.
DOI : 10.1007/3-540-52292-1_16

J. Spencer and C. R. Subramanian, On the size of induced acyclic subgraphs in random digraphs, Disc. Math. and Theoret. Comp. Sci, vol.10, issue.2, pp.47-54, 2008.
URL : https://hal.archives-ouvertes.fr/hal-00972323

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

R. P. Stanley, Enumerative Combinatorics, 1997.