<![CDATA[A Fan graph $F_n$ is defined as the graph $P_n+K_1$, where $P_n$ is the path on $n$ vertices. 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.$ Let $\mathcal{R}(G, H)$ denote the set of all graphs $F$ satisfying $F \rightarrow (G, H)$ and for every $e \in E(F),$ $(F - e) \not\rightarrow (G, H).$ In this paper, we propose some properties for a graph $G$ of minimum order that belongs to $\mathcal{R}(2K_2,F_n),$ for $n \geq 3$. We have also found all members of $\mathcal{R}(2K_2,F_n)$ with a minimum order for $n \in [3,7]$.]]>
Copyrights © 2025
