Computation of small reflective and dihedral Ramsey numbers

Ivan Damnjanović, Irena Đorđević

Throughout, all graphs are simple, finite and have vertex sets of the form $\{0,1,2,\dots ,n-1\}$ for some $n\in \mathbb{N}$. For graphs $G$ and $H$, and a permutation gro…