An Effective Version of Hall's Theorem

DOI10.2307/2045123MaRDI QIDQ3315504zbMATH OpenOpenAlexFDO

Authors H. 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

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

Recommendations

• Hall's theorem revisited
• An extension of Hall's theorem for partitioned bipartite graphs
• scientific article; zbMATH DE number 490854
• Two-Sided, Unbiased Version of Hall’s Marriage Theorem
• A condition for matchability in hypergraphs

Cited in

(8)

• On the complexity of finding the chromatic number of a recursive graph. I: The bounded case
• A theory of recursive dimension of ordered sets
• Hall's theorem revisited
• Intuitionistic provability versus uniform provability in \(\mathsf{RCA}\)
• scientific article; zbMATH DE number 4208092 (Why is no real title available?)
• Computable paradoxical decompositions
• On the strength of marriage theorems and uniformity
• scientific article; zbMATH DE number 6729335 (Why is no real title available?)

This page was built for publication: An Effective Version of Hall's Theorem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3315504)