Pages that link to "Item:Q4740597"
From MaRDI portal
The following pages link to König's Duality Theorem for Infinite Bipartite Graphs (Q4740597):
Displaying 20 items.
- Finitary and cofinitary gammoids (Q298942) (← links)
- Menger's theorem for graphs containing no infinite paths (Q594106) (← links)
- The Erdős-Menger conjecture for source/sink sets with disjoint closures (Q707026) (← links)
- LP duality in infinite hypergraphs (Q803165) (← links)
- Set systems with finite chromatic number (Q805616) (← links)
- Graph factors and factorization: 1985--2003: a survey (Q868347) (← links)
- Minimal non-two-colorable hypergraphs and minimal unsatisfiable formulas (Q1087560) (← links)
- An infinite version of Ryser's inequality (Q1087875) (← links)
- Menger's theorem for countable graphs (Q1094433) (← links)
- Matchings in infinite graphs (Q1101134) (← links)
- Infinite matching theory (Q1191911) (← links)
- Matchings from a set below to a set above (Q1191919) (← links)
- On the strength of König's duality theorem for infinite bipartite graphs (Q1193566) (← links)
- Strong LP duality in weighted infinite bipartite graphs (Q1332441) (← links)
- The countable Erdős-Menger conjecture with ends (Q1403915) (← links)
- On packing and covering polyhedra in infinite dimensions (Q1785750) (← links)
- Strongly perfect infinite graphs (Q1895072) (← links)
- Up to a double cover, every regular connected graph is isomorphic to a Schreier graph (Q2135300) (← links)
- Strongly maximal antichains in posets (Q2275382) (← links)
- The Lovász-Cherkassky theorem in countable graphs (Q2680564) (← links)
