Computation of small reflective and dihedral Ramsey numbers

Throughout, all graphs are simple, finite and have vertex sets of the form $\{ 0, 1, 2, \ldots, n - 1 \}$ for some $n \in \mathbb{N}$. For graphs $G$ and $H$, and a permutation group $\Gamma$ on the vertex set of $H$, we say that $H$ is $\Gamma$-embeddable in $G$ if there exists a graph homomorphism from $H$ to $G$ of the form $\psi \circ \varphi$, where $\varphi \in \Gamma$ and $\psi$ is an increasing injection. Recently, standard and ordered Ramsey numbers of graphs were unified through the introduction of permutational Ramsey numbers, defined as follows. For graphs $H_1, H_2, \ldots, H_k$ and permutation groups $\Gamma_1, \Gamma_2, \ldots, \Gamma_k$ on their respective vertex sets, the permutational Ramsey number $R(H_1^{\Gamma_1}, H_2^{\Gamma_2}, \ldots, H_k^{\Gamma_k})$ is the minimum $n \in \mathbb{N}$ such that for every $k$-edge-coloring of a complete graph on $n$ vertices, there exists some $j \in \{1, 2, \ldots, k\}$ for which $H_j$ is $\Gamma_j$-embeddable in the spanning subgraph of the complete graph comprising the edges of color $j$.
Here, we consider reflective (resp. dihedral) Ramsey numbers, which are a specific class of permutational Ramsey numbers in which each group $\Gamma_j$ is the reflection group (resp. dihedral group) on the naturally ordered vertex set of $H_j$. Focusing on the two-color case, we apply the SAT-based approach originally proposed by Poljak for ordered Ramsey numbers and recently extended to cyclic Ramsey numbers. We utilize the Kissat SAT solver to obtain exact values and lower bounds for small reflective and dihedral Ramsey numbers whose two arguments belong to the following graph classes: monotone and alternating paths, monotone cycles, start-central stars, complete graphs and nested matchings. We also derive several general results and formulate conjectures based on the computational findings.