Blow-up lemmas for sparse graphs, 2016. ,
The number of edge colorings with no monochromatic cliques, Journal of the London Mathematical Society, vol.70, issue.2, pp.273-288, 2004. ,
Counting sum-free sets in abelian groups ,
A local lemma via entropy compression, 2015. ,
The number of subsets of integers with no k-term arithmetic progression, International Mathematics Research Notices, vol.2017, issue.20, pp.6168-6186, 2016. ,
The number of maximal sum-free subsets of integers, Proceedings of the American Mathematical Society, vol.143, issue.11, pp.4713-4721, 2015. ,
Independent sets in hypergraphs, Journal of the American Mathematical Society, vol.28, issue.3, pp.669-709, 2015. ,
The number of the maximal triangle-free graphs, Bulletin of the London Mathematical Society, vol.46, issue.5, pp.1003-1006, 2014. ,
, The number of k m, m-free graphs, vol.31, p.2, 2011.
Edge-colorings of graphs avoiding complete graphs with a prescribed coloring, Discrete Mathematics, vol.340, issue.9, 2017. ,
A note on perfect graphs, Periodica Mathematica Hungarica, vol.17, issue.3, pp.173-175, 1986. ,
Gallai-colorings of triples and 2-factors of, International Journal of Combinatorics, p.1, 2013. ,
On the number of b h-sets, Combinatorics, Probability and Computing, vol.25, issue.1, pp.108-129, 2016. ,
Some new applications of probability methods to combinatorial analysis and graph theory, p.2, 1974. ,
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
Multicolour containers and the entropy of decorated graph limits, p.2, 2016. ,
Transitiv orientierbare Graphen, Acta Math. Acad. Sci. Hungar, vol.18, p.1, 1967. ,
Transitiv orientierbare Graphen, A translation of T. Gallai's paper, vol.18, pp.25-66, 1967. ,
Gallai colorings of non-complete graphs, Discrete Mathematics, vol.310, issue.5, 2010. ,
Edge colorings of complete graphs without tricolored triangles, Journal of Graph Theory, vol.46, issue.3, p.1, 2004. ,
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.
Szemerédi's regularity lemma for sparse graphs, Foundations of computational mathematics, vol.2, pp.216-230, 1997. ,
An extremal problem for random graphs and the number of graphs with large even-girth, Combinatorica, vol.18, issue.1, 1998. ,
The regularity lemma and its applications in graph theory, Theoretical aspects of computer science, vol.2, pp.84-112, 2000. ,
Szemerédi's regularity lemma and its applications in graph theory, p.2, 1996. ,
Graph pairs and their entropies: modularity problems, Combinatorica, vol.20, issue.2, pp.227-240, 2000. ,
Perfect couples of graphs, Combinatorica, vol.12, issue.2, p.1, 1992. ,
The number of C 2? -free graphs, Advances in Mathematics, vol.298, 2016. ,
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. ,
, Hypergraph containers, Inventiones mathematicae, vol.201, pp.925-992, 2015.