König's Duality Theorem for Infinite Bipartite Graphs
From MaRDI portal
Publication:4740597
DOI10.1112/jlms/s2-29.1.1zbMath0505.05049OpenAlexW2114935093WikidataQ56626046 ScholiaQ56626046MaRDI QIDQ4740597
Publication date: 1984
Published in: Journal of the London Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1112/jlms/s2-29.1.1
Related Items
Strong LP duality in weighted infinite bipartite graphs, Minimal non-two-colorable hypergraphs and minimal unsatisfiable formulas, An infinite version of Ryser's inequality, Up to a double cover, every regular connected graph is isomorphic to a Schreier graph, Finitary and cofinitary gammoids, Menger's theorem for countable graphs, Strongly perfect infinite graphs, Matchings in infinite graphs, Graph factors and factorization: 1985--2003: a survey, Menger's theorem for graphs containing no infinite paths, Menger's Theorem for a Countable Source Set, The Lovász-Cherkassky theorem in countable graphs, The countable Erdős-Menger conjecture with ends, Infinite matching theory, Matchings from a set below to a set above, On the strength of König's duality theorem for infinite bipartite graphs, The Erdős-Menger conjecture for source/sink sets with disjoint closures, Strongly maximal antichains in posets, On packing and covering polyhedra in infinite dimensions, LP duality in infinite hypergraphs, Set systems with finite chromatic number
