English

Existence thresholds and Ramsey properties of random posets

Combinatorics 2020-06-19 v2

Abstract

Let P(n)\mathcal P(n) denote the power set of [n][n], ordered by inclusion, and let P(n,p)\mathcal P (n,p) denote the random poset obtained from P(n)\mathcal P(n) by retaining each element from P(n)\mathcal P (n) independently at random with probability pp and discarding it otherwise. Given any fixed poset FF we determine the threshold for the property that P(n,p)\mathcal P(n,p) contains FF as an induced subposet. We also asymptotically determine the number of copies of a fixed poset FF in P(n)\mathcal P(n). Finally, we obtain a number of results on the Ramsey properties of the random poset P(n,p)\mathcal P(n,p).

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