... Sufficient conditions for circuits in graphs, Proc. London Math. Soc.24 (1972) 739-755.[5] Radziszowski S.P.: Small Ramsey Numbers, Electronic Journal of Combinatorics,Dynamic Survey 1, revision #12, ... which belong to each graphs among H1, H2and H3. Let us considerall 30 edges to be of color 1 in (C4, C4, K4− e; 15)-coloring.Finally, consider again the edges of the second extremal ... http://www.combinatorics.org.[6] Radziszowski S.P., Shao Z., Xu X.: Bounds on some Ramsey numbers involvingquadrilateral, Ars Combinatoria 90 (2009) 337–344.the electronic journal of combinatorics 18...