Large Subposets with Small Dimension

Dorais asked for the maximum guaranteed size of a subposet with dimension at most d of an n-element poset. A lower bound of order \(\sqrt {n}\) was found by Goodwillie. We provide a sublinear upper bound for each d. For d = 2, our bound is n 0.8295.