The following pages link to Matchings in infinite graphs (Q1101134):
Displaying 17 items.
- Perfect matchings as IID factors on non-amenable groups (Q648969) (← links)
- On an obstruction for perfect matchings (Q793753) (← links)
- LP duality in infinite hypergraphs (Q803165) (← links)
- Graph factors and factorization: 1985--2003: a survey (Q868347) (← links)
- Menger's theorem for infinite graphs (Q1016232) (← links)
- Matchings in graphs of size \(\aleph_ 1\) (Q1055786) (← links)
- Faktoren in unendlichen Graphen. (Factors in infinite graphs) (Q1066919) (← links)
- A compactness result for perfect matchings (Q1106214) (← links)
- Infinite matching theory (Q1191911) (← links)
- Matchable infinite graphs (Q1338312) (← links)
- Counting 1-factors in infinite graphs (Q1814587) (← links)
- Uniqueness of the infinite noodle (Q2421731) (← links)
- The computational strength of matchings in countable graphs (Q2672158) (← links)
- The Lovász-Cherkassky theorem in countable graphs (Q2680564) (← links)
- (Q4635970) (← links)
- Injective choice functions (Q5903315) (← links)
- The Lovász-Cherkassky theorem in infinite graphs (Q6658774) (← links)