Existence thresholds and Ramsey properties of random posets
Combinatorics
2020-06-19 v2
Abstract
Let denote the power set of , ordered by inclusion, and let denote the random poset obtained from by retaining each element from independently at random with probability and discarding it otherwise. Given any fixed poset we determine the threshold for the property that contains as an induced subposet. We also asymptotically determine the number of copies of a fixed poset in . Finally, we obtain a number of results on the Ramsey properties of the random poset .
Keywords
Cite
@article{arxiv.1910.00485,
title = {Existence thresholds and Ramsey properties of random posets},
author = {Victor Falgas-Ravry and Klas Markström and Andrew Treglown and Yi Zhao},
journal= {arXiv preprint arXiv:1910.00485},
year = {2020}
}
Comments
33 pages, 2 figures. Author accepted manuscript, to appear in Random Structures and Algorithms