D. Achlioptas and A. Coja-oghlan, Algorithmic barriers from phase transitions, 49th Annual IEEE Symposium on Foundations of Computer Science, pp.793-802, 2008.

D. Achlioptas, F. Iliopoulos, and A. Sinclair, Beyond the Lovász Local Lemma: Point to Set Correlations and Their Algorithmic Applications, 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS), pp.725-744, 2019.

M. Ajtai, J. Komlós, and E. Szemerédi, A note on Ramsey numbers, J. Combin. Theory Ser. A, vol.29, issue.3, pp.354-360, 1980.

M. Ajtai, J. Komlós, and E. Szemerédi, A dense infinite Sidon sequence, European J. Combin, vol.2, issue.1, pp.1-11, 1981.

N. Alon, M. Krivelevich, and B. Sudakov, Coloring Graphs with Sparse Neighborhoods, Journal of Combinatorial Theory, Series B, vol.77, issue.1, pp.73-82, 1999.

N. Bansal, A. Gupta, and G. Guruganesh, On the Lovász Theta function for Independent Sets in Sparse Graphs, 2015.

A. Bernshteyn, The Johansson-Molloy theorem for DP-coloring, Random Structures & Algorithms, vol.54, issue.4, pp.653-664, 2019.

H. Bodlaender, On Linear Time Minor Tests with Depth-First Search, Journal of Algorithms, vol.14, issue.1, pp.1-23, 1993.

T. Bohman, The triangle-free process, Adv. Math, vol.221, issue.5, pp.1653-1677, 2009.

T. Bohman and P. Keevash, Dynamic concentration of the triangle-free process, 2019.

A. Coja-oghlan and C. Efthymiou, On independent sets in random graphs, Random Structures Algorithms, vol.47, issue.3, pp.436-486, 2015.

R. M. Corless, G. H. Gonnet, D. E. Hare, D. J. Jeffrey, and D. E. Knuth, On the Lambert W function, Advances in Computational Mathematics, vol.5, issue.1, pp.329-359, 1996.

E. Davies, R. De-joannis-de-verclos, R. J. Kang, and F. Pirot, Colouring triangle-free graphs with local list sizes, 2018.

E. Davies, R. De-joannis-de-verclos, R. J. Kang, and F. Pirot, Occupancy fraction, fractional colouring, and triangle fraction, 2018.

E. Davies, M. Jenssen, W. Perkins, and B. Roberts, Independent sets, matchings, and occupancy fractions, Journal of the London Mathematical Society, vol.96, issue.1, pp.47-66, 2017.

E. Davies, M. Jenssen, W. Perkins, and B. Roberts, On the average size of independent sets in triangle-free graphs, Proc. Amer. Math. Soc, vol.146, issue.1, pp.111-124, 2018.

E. Davies, R. J. Kang, F. Pirot, and J. Sereni, Graph structure via local occupancy, 2020.
URL : https://hal.archives-ouvertes.fr/hal-02529403

Z. Dvo?ák and L. Postle, Correspondence coloring and its application to list-coloring planar graphs without cycles of lengths 4 to 8, Journal of Combinatorial Theory, Series B, vol.129, pp.38-54, 2018.

P. Erd?s, Some remarks on the theory of graphs, Bull. Amer. Math. Soc, vol.53, pp.292-294, 1947.

P. Erd?s, Graph theory and probability, Canadian J. Math, vol.11, pp.34-38, 1959.

P. Erd?s and G. Szekeres, A combinatorial problem in geometry, Compositio Math, vol.2, pp.463-470, 1935.

P. Erd?s and T. Gallai, On maximal paths and circuits of graphs, Acta Mathematica Academiae Scientiarum Hungaricae, vol.10, issue.3-4, pp.337-356, 1959.

P. Erd?s and L. Lovász, Problems and results on 3-chromatic hypergraphs and some related questions, Infinite and Finite Sets (Colloq, vol.II, pp.609-627, 1973.

L. Esperet and A. Parreau, Acyclic edge-coloring using entropy compression, European J. Combin, vol.34, issue.6, pp.1019-1027, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00843770

G. Fiz-pontiveros, S. Griffiths, and R. Morris, The Triangle-Free Process and the Ramsey Number R(3, k), vol.263, 1274.

M. M. Halldórsson and J. Radhakrishnan, Improved approximations of independent sets in bounded-degree graphs, Algorithm Theory -SWAT '94, vol.824, pp.195-206, 1994.

F. Iliopoulos, Stochastic Local Search and the Lovasz Local Lemma, 2019.

A. Johansson, Asymptotic choice number for triangle-free graphs, 1996.

R. J. Kang and C. Mcdiarmid, Colouring random graphs, Topics in chromatic graph theory, vol.156, pp.199-229, 2015.
URL : https://hal.archives-ouvertes.fr/inria-00070259

R. M. Karp, Reducibility among Combinatorial Problems, Complexity of Computer Computations, pp.85-103, 1972.

R. M. Karp, The probabilistic analysis of some combinatorial search algorithms, Algorithms and complexity (Proc. Sympos, pp.1-19, 1976.

J. H. Kim, On Brooks' Theorem for Sparse Graphs, Combinatorics, Probability and Computing, vol.4, issue.2, pp.97-132, 1995.

J. H. Kim, The Ramsey number R(3, t) has order of magnitude t 2 / log t, Random Structures Algorithms, vol.7, issue.3, pp.173-207, 1995.

M. Molloy, The list chromatic number of graphs with small clique number, Journal of Combinatorial Theory, Series B, vol.134, pp.264-284, 2019.

M. Molloy and B. Reed, Graph Colouring and the Probabilistic Method, Algorithms and Combinatorics, 2002.

R. A. Moser, A constructive proof of the Lovász local lemma, STOC'09-Proceedings of the 2009 ACM International Symposium on Theory of Computing, pp.343-350, 2009.

R. A. Moser and G. Tardos, A constructive proof of the general Lovász local lemma, Journal of the ACM, vol.57, issue.2, pp.1-15, 2010.

A. Panconesi and A. Srinivasan, Randomized Distributed Edge Coloring via an Extension of the Chernoff-Hoeffding Bounds, SIAM Journal on Computing, vol.26, issue.2, pp.350-368, 1997.

F. P. Ramsey, On a Problem of Formal Logic, Proc. London Math. Soc, vol.30, issue.2, pp.264-286, 1929.

J. B. Shearer, A note on the independence number of triangle-free graphs, Discrete Mathematics, vol.46, issue.1, pp.83-87, 1983.

P. Ungar and B. Descartes, Advanced Problems and Solutions: Solutions: 4526, The American Mathematical Monthly, vol.61, issue.5, p.352, 1954.

V. G. Vizing, Some unsolved problems in graph theory. Uspehi Mat. Nauk, vol.23, pp.117-134, 1968.

V. H. Vu, A General Upper Bound on the List Chromatic Number of Locally Sparse Graphs, Combinatorics, Probability and Computing, vol.11, issue.1, pp.103-111, 2002.

L. Zdeborová and F. Krz?ka?a, Phase transitions in the coloring of random graphs, Physical Review E, vol.76, issue.3, p.31131, 2007.

A. A. Zykov, On some properties of linear complexes, Mat. Sbornik N.S, vol.24, issue.66, pp.163-188, 1949.