More on the indivisibility of $\mathbb{Q}$

We study the complexity of the computational task ``Given a colouring $c:\mathbb{Q}\to \mathbf{k}$, find a monochromatic $S\subseteq \mathbb{Q}$ such that $(S,<)\cong (\mathbb{Q},<)$‘’. The framework is Weihrauch reducibility. Our results answer some open questions recently raised by Gill, and by Dzhafarov, Solomon and Valenti.