Name
Abstract | ||
|---|---|---|
How large an antichain can we find inside a given downset in the Boolean lattice B(n)? Sperner’s theorem asserts that the largest antichain in the whole of B(n) has size n⌊n∕2⌋; what happens for general downsets? |
Year | DOI | Venue |
|---|---|---|
2019 | 10.1016/j.ejc.2018.11.005 | European Journal of Combinatorics |
Field | DocType | Volume |
Discrete mathematics,Antichain,Combinatorics,Decomposition theorem,Boolean algebra (structure),Conjecture,Mathematics | Journal | 79 |
ISSN | Citations | PageRank |
0195-6698 | 0 | 0.34 |
References | Authors | |
1 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Dwight Duffus | 1 | 111 | 36.63 |
| David Howard | 2 | 15 | 3.51 |
| Imre Leader | 3 | 266 | 49.79 |