Pages that link to "Item:Q1193566"
From MaRDI portal
The following pages link to On the strength of König's duality theorem for infinite bipartite graphs (Q1193566):
Displaying 13 items.
- Menger's theorem in \(\Pi^1_1 \mathrm {-CA}_0\) (Q412061) (← links)
- Computing maximal chains (Q453200) (← links)
- Ordinals and graph decompositions (Q508830) (← links)
- Graph factors and factorization: 1985--2003: a survey (Q868347) (← links)
- Infinite matching theory (Q1191911) (← links)
- Matchings from a set below to a set above (Q1191919) (← links)
- Hamiltonian paths in infinite graphs (Q1196345) (← links)
- The computational strength of matchings in countable graphs (Q2672158) (← links)
- 2010 European Summer Meeting of the Association for Symbolic Logic. Logic Colloquium '10 (Q3011106) (← links)
- Reverse Mathematics: The Playground of Logic (Q3163663) (← links)
- On the strength of König's duality theorem for countable bipartite graphs (Q4292597) (← links)
- ON THE UNCOUNTABILITY OF (Q5052009) (← links)
- (EXTRA)ORDINARY EQUIVALENCES WITH THE ASCENDING/DESCENDING SEQUENCE PRINCIPLE (Q6203557) (← links)
