1. The number of edge colorings with no monochromatic cliques;Alon;J. London Math. Soc.,2004
2. P. Erdös, Some new applications of probability methods to combinatorial analysis and graph theory, Proc. of the Fifth Southeastern Conference on Combinatorics, Graph Theory and Computing (Florida Atlantic Univ., Boca Raton, Fla., 1974), 39–51. Congressus Numerantium, No. X, Utilitas Math., 1974, 39–51.
3. On maximal paths and circuits of graphs;Erdös;Acta Math. Acad. Sci. Hungar.,1959
4. C. Hoppen, Y. Kohayakawa, and H. Lefmann, Edge colorings of graphs avoiding monochromatic matchings of a given size, preprint.