Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with co.combinatorics
Search options not deleted
user 36985
Enumerative combinatorics, graph theory, order theory, posets, matroids, designs and other discrete structures. It also includes algebraic, analytic and probabilistic combinatorics.
3
votes
Accepted
A variant of Kruskal's theorem
To reformulate your question, given a wqo $(A,\leq)$, here finite trees with the minor ordering, you ask whether $({\mathcal P}_\mathrm{fin}(A),\sqsubseteq)$ the set of finite subsets of $A$ with a `m …
- 236
3
votes
Does the rank (=height) of a well partial order bound its type (=length, =stature)?
The height (aka rank) and maximal order type (aka type, aka length, aka stature) of a wpo are not functionally related.
Consider for instance the family of finite partial orders (thus wpos) $P_n=\{a_ …
- 236