Large subposets with small dimension
Abstract
Dorais asked for the maximum guaranteed size of a dimension d subposet of an n-element poset. A lower bound of order n was found by Goodwillie. We provide a sublinear upper bound for each d. For d=2, our bound is n0.8295.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.