The complete list of Ramsey $(2K_2,K_4)$-minimal graphs

Abstract

Let $F, G,$ and $H$ be non-empty graphs. The notation $F \rightarrow (G,H)$ means that if all edges of $F$ are arbitrarily colored by red or blue, then either the subgraph of $F$ induced by all red edges contains a graph $G$ or the subgraph of $F$ induced by all blue edges contains a graph $H.$ A graph $F$ satisfying two conditions: $F \rightarrow (G,H)$ and $(F-e) \nrightarrow (G,H)$ for every $e \in E(F)$ is called a Ramsey $(G,H)-$minimal graph. In this paper, we determine all non-isomorphic Ramsey $(2K_2,K_4)$-minimal graphs.

Keywords

• ramsey minimal graph, red-blue coloring, complete graph