3 problems
Matching
Milner–Sauer conjecture. If , then contains an antichain of size .
For a positive integer , let be the poset consisting of two disjoint -element chains with no comparabilities between distinct chains. Let…
For positive integers and , let be the maximum size of a subset of in which every two vectors are -crossing but no two vectors are -crossing. F…