Pages that link to "Well-quasi-ordering"
From HandWiki
The following pages link to Well-quasi-ordering:
Displayed 39 items.
View (previous 50 | next 50) (20 | 50 | 100 | 250 | 500)- Dickson's lemma (← links)
- Join and meet (← links)
- Kruskal's tree theorem (← links)
- Equivalence relation (← links)
- List of order structures in mathematics (← links)
- List of order theory topics (← links)
- Weak ordering (← links)
- Ordinal arithmetic (← links)
- Total order (← links)
- Transitive relation (← links)
- Better-quasi-ordering (← links)
- Bratteli–Vershik diagram (← links)
- Higman's lemma (← links)
- Partially ordered set (← links)
- Preorder (← links)
- Prewellordering (← links)
- Well-order (← links)
- Semilattice (← links)
- Lattice (order) (← links)
- Well-structured transition system (← links)
- Antisymmetric relation (← links)
- Transitive closure (← links)
- Tree-depth (← links)
- Well-founded relation (← links)
- Connex relation (← links)
- Binary relation (← links)
- Branch-decomposition (← links)
- Asymmetric relation (← links)
- Cograph (← links)
- Matroid minor (← links)
- Graph minor (← links)
- Robertson–Seymour theorem (← links)
- Laver's theorem (← links)
- Connected relation (← links)
- Reflexive relation (← links)
- Template:Binary relations (← links)
- Biography:Richard Laver (← links)
- Biography:Joseph Kruskal (← links)
- Biography:Thomas Forster (mathematician) (← links)
