An Effective Version of Hall's Theorem

DOI10.2307/2045123zbMath0533.03028OpenAlexW4250523650MaRDI QIDQ3315504

Henry A. Kierstead

Publication date: 1983

Published in: Proceedings of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2045123

zbMATH Keywords

bipartite graphrecursive matching

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Theory of numerations, effectively presented structures (03D45)

Related Items

Intuitionistic Provability versus Uniform Provability in $$\mathsf{RCA}$$ ⋮ Computable paradoxical decompositions ⋮ On the strength of marriage theorems and uniformity ⋮ A theory of recursive dimension of ordered sets ⋮ On the complexity of finding the chromatic number of a recursive graph. I: The bounded case