P. Allen, J. Böttcher, H. Hàn, Y. Kohayakawa, and Y. Person, Blow-up lemmas for sparse graphs, 2016.

N. Alon, J. Balogh, P. Keevash, and B. Sudakov, The number of edge colorings with no monochromatic cliques, Journal of the London Mathematical Society, vol.70, issue.2, pp.273-288, 2004.

N. Alon, J. Balogh, R. Morris, and W. Samotij, Counting sum-free sets in abelian groups

R. G. Alves, A. Procacci, and R. Sanchis, A local lemma via entropy compression, 2015.

J. Balogh, H. Liu, and M. Sharifzadeh, The number of subsets of integers with no k-term arithmetic progression, International Mathematics Research Notices, vol.2017, issue.20, pp.6168-6186, 2016.

J. Balogh, H. Liu, M. Sharifzadeh, and A. Treglown, The number of maximal sum-free subsets of integers, Proceedings of the American Mathematical Society, vol.143, issue.11, pp.4713-4721, 2015.

J. Balogh, R. Morris, and W. Samotij, Independent sets in hypergraphs, Journal of the American Mathematical Society, vol.28, issue.3, pp.669-709, 2015.

J. Balogh and ?. Pet?í?ková, The number of the maximal triangle-free graphs, Bulletin of the London Mathematical Society, vol.46, issue.5, pp.1003-1006, 2014.

J. Balogh and W. Samotij, The number of k m, m-free graphs, vol.31, p.2, 2011.

F. Benevides, C. Hoppen, and R. Sampaio, Edge-colorings of graphs avoiding complete graphs with a prescribed coloring, Discrete Mathematics, vol.340, issue.9, 2017.

K. Cameron, J. Edmonds, and L. Lovász, A note on perfect graphs, Periodica Mathematica Hungarica, vol.17, issue.3, pp.173-175, 1986.

L. Chua, A. Gyárfás, and C. Hossain, Gallai-colorings of triples and 2-factors of, International Journal of Combinatorics, p.1, 2013.

D. Dellamonica, Y. Kohayakawa, S. J. Lee, V. Rddl, and W. Samotij, On the number of b h-sets, Combinatorics, Probability and Computing, vol.25, issue.1, pp.108-129, 2016.

P. Erdös, Some new applications of probability methods to combinatorial analysis and graph theory, p.2, 1974.

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

V. Falgas-ravry, K. O'connell, J. Strömberg, and A. Uzzell, Multicolour containers and the entropy of decorated graph limits, p.2, 2016.

T. Gallai, Transitiv orientierbare Graphen, Acta Math. Acad. Sci. Hungar, vol.18, p.1, 1967.

T. Gallai, Transitiv orientierbare Graphen, A translation of T. Gallai's paper, vol.18, pp.25-66, 1967.

A. Gyárfás and G. Sárközy, Gallai colorings of non-complete graphs, Discrete Mathematics, vol.310, issue.5, 2010.

A. Gyárfás and G. Simonyi, Edge colorings of complete graphs without tricolored triangles, Journal of Graph Theory, vol.46, issue.3, p.1, 2004.

C. Hoppen, H. Lefmann, and K. Odermann, A rainbow erd?s-rothschild problem, Electronic Notes in Discrete Mathematics, vol.49, 2015.

, On graphs with a large number of edge-colorings avoiding a rainbow triangle, European Journal of Combinatorics, vol.66, 2017.

Y. Kohayakawa, Szemerédi's regularity lemma for sparse graphs, Foundations of computational mathematics, vol.2, pp.216-230, 1997.

Y. Kohayakawa, B. Kreuter, and A. Steger, An extremal problem for random graphs and the number of graphs with large even-girth, Combinatorica, vol.18, issue.1, 1998.

J. Komlós, A. Shokoufandeh, M. Simonovits, and E. Szemerédi, The regularity lemma and its applications in graph theory, Theoretical aspects of computer science, vol.2, pp.84-112, 2000.

J. Komlós and M. Simonovits, Szemerédi's regularity lemma and its applications in graph theory, p.2, 1996.

J. Körner and G. Simonyi, Graph pairs and their entropies: modularity problems, Combinatorica, vol.20, issue.2, pp.227-240, 2000.

J. Körner, G. Simonyi, and Z. Tuza, Perfect couples of graphs, Combinatorica, vol.12, issue.2, p.1, 1992.

R. Morris and D. Saxton, The number of C 2? -free graphs, Advances in Mathematics, vol.298, 2016.

O. Pikhurko, K. Staden, and Z. Yilma, The erd?s-rothschild problem on edge-colourings with forbidden monochromatic cliques, Mathematical proceedings of the cambridge philosophical society, vol.2, pp.341-356, 2017.

D. Saxton and A. Thomason, Hypergraph containers, Inventiones mathematicae, vol.201, pp.925-992, 2015.