We consider several variations of the following problem: fix a countable graph G. Is an input graph H a(n induced) subgraph of G? If yes, can we find a copy of H in G? The challenge to classify the Weihrauch degrees of such problems was put forth recently by BeMent, Hirst, and Wallace (“Reverse mathematics and Weihrauch analysis motivated by finite complexity theory”, Computability, 2021). We report some initial results here, and in particular, solve one of their open questions.
