An effective version of hall's theorem

Henry A. Kierstead

doi:10.1090/S0002-9939-1983-0691291-0

An effective version of hall's theorem

Henry A. Kierstead

Research output: Contribution to journal › Article › peer-review

12 Scopus citations

Abstract

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 language	English (US)
Pages (from-to)	124-128
Number of pages	5
Journal	Proceedings of the American Mathematical Society
Volume	88
Issue number	1
DOIs	https://doi.org/10.1090/S0002-9939-1983-0691291-0
State	Published - May 1983
Externally published	Yes

ASJC Scopus subject areas

General Mathematics
Applied Mathematics

Access to Document

10.1090/S0002-9939-1983-0691291-0

Cite this

@article{a5d634dca99e4b28a2464730129c4853,

title = "An effective version of hall's theorem",

abstract = "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.",

author = "Kierstead, {Henry A.}",

year = "1983",

month = may,

doi = "10.1090/S0002-9939-1983-0691291-0",

language = "English (US)",

volume = "88",

pages = "124--128",

journal = "Proceedings of the American Mathematical Society",

issn = "0002-9939",

publisher = "American Mathematical Society",

number = "1",

}

TY - JOUR

T1 - An effective version of hall's theorem

AU - Kierstead, Henry A.

PY - 1983/5

Y1 - 1983/5

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84966240942&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84966240942&partnerID=8YFLogxK

U2 - 10.1090/S0002-9939-1983-0691291-0

DO - 10.1090/S0002-9939-1983-0691291-0

M3 - Article

AN - SCOPUS:84966240942

SN - 0002-9939

VL - 88

SP - 124

EP - 128

JO - Proceedings of the American Mathematical Society

JF - Proceedings of the American Mathematical Society

IS - 1

ER -

An effective version of hall's theorem

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this