On Monochromatic Subgraphs of Edge-Colored Complete Graphs

Abstract

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.

Keywords

• ramsey number
• monochromatic ramsey number
• common monochromatic subgraph
• maximal common monochromatic subgraph