Timeline for Maximum size of a union of incomparable chains
Current License: CC BY-SA 3.0
2 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Sep 24, 2015 at 3:31 | comment | added | Gerhard Paseman | Alternatively, one could use a slowly branching tree. Let (1) be the root, and for any member s with terminal element n, throw in s concat (2n) and s concat (2n+1). One can tweak the branching rate and other levels to push c to 1/2 or perhaps below. Gerhard "Construction Lovely As A Tree" Paseman, 2015.09.23 | |
| Sep 24, 2015 at 3:24 | history | answered | Noah Schweber | CC BY-SA 3.0 |