Large subposets with small dimension
classification
🧮 math.CO
keywords
bounddimensionaskeddoraiselementfoundgoodwillieguaranteed
read the original abstract
Dorais asked for the maximum guaranteed size of a dimension $d$ subposet 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}$.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.