On the strength of König's duality theorem for infinite bipartite graphs
type: Item
instance of: scholarly article
title: On the strength of König's duality theorem for infinite bipartite graphs
zbMATH Open document ID: 0754.05053
DOI: 10.1016/0095-8956(92)90057-5
author: Ron Aharoni
author: Menachem Magidor
author: Richard A. Shore
published in: Journal of Combinatorial Theory. Series B
publication date: 1992-09-27T00:00:00Z
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 03D55
Mathematics Subject Classification ID: 03F35
Mathematics Subject Classification ID: 03F25
Mathematics Subject Classification ID: 03E25
Mathematics Subject Classification ID: 05C05
zbMATH DE Number: 64854
zbMATH Keywords: König's duality theorem
zbMATH Keywords: bipartite graphs
zbMATH Keywords: computational complexity
zbMATH Keywords: cover
zbMATH Keywords: Turing jump
zbMATH Keywords: compactness
zbMATH Keywords: maximality property
MaRDI profile type: Publication
full work available at URL: 0095-8956(92)90057-5
OpenAlex ID: W2065601606
cites work: On a Duality Principle in Infinite Bipartite Graphs
cites work: König's Duality Theorem for Infinite Bipartite Graphs
cites work: Strong transfinite version of König's duality theorem
cites work: Harvey Friedman's research on the foundations of mathematics
cites work: Q3478406
cites work: Injective choice functions
cites work: Ramsey's theorem and recursion theory
cites work: ∏ 0 1 Classes and Degrees of Theories
cites work: An Effective Version of Dilworth's Theorem
cites work: A theory of recursive dimension of ordered sets
cites work: Matching theory
cites work: Injective choice functions for countable families
cites work: Q5573961
cites work: Recursive Colorings of Graphs
cites work: The Effective Version of Brooks' Theorem
cites work: Q3699664
cites work: Proof theory. 2nd ed
cites work: On Schmerl's effective version of Brooks' theorem
description: scientific article; zbMATH DE number 64854