Let be a graph on vertices. Then, there exists a graph such that any coloring of the edges of using two colors contains a monochromatic induced copy of (i.e. an induced subgraph of such that it is isomorphic to and its edges are monochromatic). The smallest possible number of vertices of is the induced Ramsey number .
