Equality of induced and non-induced Euclidean Ramsey numbers
Determine whether, for every finite graph $H$, the induced and non-induced Euclidean Ramsey functions satisfy ${^n}{H}=#2{^n}{H}$ whenever the dimension $n$ is sufficiently large in terms of $H$.
References
Is it true that for each graph $H$, we have ${n}{H} = #2{n}{H}$ provided that $n$ is sufficiently large in terms of $H$?
— Ramsey problems for graphs in Euclidean spaces and Cartesian powers
(2512.15516 - Axenovich et al., 17 Dec 2025) in Question Q_ind, Section 6.2 (Growing dimension)