On monochromatic subgraphs of edge-colored complete graphs
Eric Andrews, Futaba Fujie, Kyle Kolasinski, Chira Lumduanhom, Adam Yusko · Discussiones Mathematicae Graph Theory · 2013
In a red-blue coloring of a nonempty graph, every edge is colored red or blue. If the resulting edge-colored graph contains a nonempty subgraph G without isolated vertices every edge of which is colored the same, then G is said to be monochromatic.