An effective version of hall's theorem

Research output: Contribution to journalArticlepeer-review

12 Scopus citations


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 discuss a natural extension of Hall's condition which assures that every such graph has a recursive matching.

Original languageEnglish (US)
Pages (from-to)124-128
Number of pages5
JournalProceedings of the American Mathematical Society
Issue number1
StatePublished - May 1983
Externally publishedYes

ASJC Scopus subject areas

  • General Mathematics
  • Applied Mathematics


Dive into the research topics of 'An effective version of hall's theorem'. Together they form a unique fingerprint.

Cite this