Infinite matching theory
From MaRDI portal
Publication:1191911
DOI10.1016/0012-365X(91)90327-XzbMath0763.05074MaRDI QIDQ1191911
Publication date: 27 September 1992
Published in: Discrete Mathematics (Search for Journal in Brave)
linear programmingwebscovershypergraphsmatchingsstochastic matrixinfinite graphsMenger's theoreminfinite matching theory
Linear programming (90C05) Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Transversal (matching) theory (05D15) Stochastic matrices (15B51)
Related Items
Strong LP duality in weighted infinite bipartite graphs, Strongly perfect infinite graphs, Random complex zeroes. II. Perturbed lattice, A counterexample to Aharoni's strongly maximal matching conjecture, Graph factors and factorization: 1985--2003: a survey, On the infinite Lucchesi–Younger conjecture I, The Lovász-Cherkassky theorem in countable graphs, Matching variables to equations in infinite linear equation systems, A note on the minimum size of matching-saturated graphs, Greene-Kleitman's theorem for infinite posets, Strongly maximal antichains in posets, On packing and covering polyhedra in infinite dimensions, Topological complexity of graphs and their spanning trees, Menger's theorem for infinite graphs, The reflection distance between zigzag persistence modules, Duality and Optimality of Auctions for Uniform Distributions
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Menger's theorem for graphs containing no infinite paths
- A generalization of Tutte's 1-factor theorem to countable graphs
- LP duality in infinite hypergraphs
- On the equivalence of two conditions for the existence of transversals
- Menger's theorem for countable graphs
- Matchings in infinite graphs
- Optimal fractional matchings and covers in infinite hypergraphs: existence and duality
- On the strength of König's duality theorem for infinite bipartite graphs
- Greene-Kleitman's theorem for infinite posets
- Necessary and sufficient conditions for transversals of countable set systems
- On Dilworth's decomposition theorem
- Injective choice functions for countable families
- A General Criterion for the Existence of Transversals
- Matchings in Countable Graphs
- Über Translationen und den Satz von Menger in unendlichen Graphen
- Another Criterion for Marriage in Denumerable Societies
- König's Duality Theorem for Infinite Bipartite Graphs
- On Representatives of Subsets
- The Factorization of Linear Graphs
- Distinct representatives of subsets
- On factorisation of graphs
- The Factors of Graphs
- Injective choice functions
- The structure of Sperner k-families
