Manaster and Rosenstein [1972] constructed a recursively bipartite highly recursive graph that satisfies Hall's condition for a bipartite graph to have a matching, but has no recursive matching. We ...