An effective version of hall's theorem

Research output: Contribution to journalArticle

11 Citations (Scopus)

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 languageEnglish (US)
Pages (from-to)124-128
Number of pages5
JournalProceedings of the American Mathematical Society
Volume88
Issue number1
DOIs
StatePublished - 1983
Externally publishedYes

Fingerprint

Theorem
Natural Extension
Graph in graph theory
Bipartite Graph

ASJC Scopus subject areas

  • Mathematics(all)
  • Applied Mathematics

Cite this

An effective version of hall's theorem. / Kierstead, Henry.

In: Proceedings of the American Mathematical Society, Vol. 88, No. 1, 1983, p. 124-128.

Research output: Contribution to journalArticle

@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 = "Henry Kierstead",
year = "1983",
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

PY - 1983

Y1 - 1983

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

VL - 88

SP - 124

EP - 128

JO - Proceedings of the American Mathematical Society

JF - Proceedings of the American Mathematical Society

SN - 0002-9939

IS - 1

ER -