... Sudakov, Ramsey-type problem for an almost monochromatic K4 , SIAM J of Discrete Math 23, (2008), 155–162 [12] V Jungic, T Kaiser, D Kral, A note on edge-colourings avoiding rainbow K4 and monochromatic ... Montellano-Ballesteros, V Neumann-Lara, An anti-Ramsey theorem on cycles, Graphs Combin 21 (2005), no 3, 343–354 [17] J J Montellano-Ballesteros, V Neumann-Lara, An anti-Ramsey theorem, Combinatorica ... |c| Observe that c∗ is a blow-up of a lexical coloring with parts inducing rainbow complete subgraphs Any monochromatic bipartite subgraph in c∗ and c∗∗ is a subgraph of Kk−1,t and Ks−1,t for...