Existence thresholds and Ramsey properties of random posets

DOI10.1002/RSA.20952MaRDI QIDQ3386529zbMATH OpenOpenAlexFDO

Authors Victor Falgas-Ravry, Klas Markström, Andrew Treglown, Yi Zhao

Publication date 5 January 2021

Published in Random Structures \& Algorithms (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1910.00485

zbMATH Keywords

Boolean latticerandom posetsRamsey propertiesexistence thresholds

Mathematics Subject Classification ID

Combinatorics of partially ordered sets (06A07) Ramsey theory (05D10)

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

Recommendations

• First order properties of random posets
• Ramsey properties of random discrete structures
• The dimension of random ordered sets
• Threshold Functions for Ramsey Properties
• Random orders of dimension 2

Cites work

• scientific article; zbMATH DE number 3168330 (Why is no real title available?)
• scientific article; zbMATH DE number 4212111 (Why is no real title available?)
• scientific article; zbMATH DE number 3769673 (Why is no real title available?)
• scientific article; zbMATH DE number 524135 (Why is no real title available?)
• scientific article; zbMATH DE number 1540669 (Why is no real title available?)
• scientific article; zbMATH DE number 3223273 (Why is no real title available?)
• A random version of Sperner's theorem
• An upper bound on the size of diamond-free families of sets
• Applications of graph containers in the Boolean lattice
• Asymptotic Enumeration of Partial Orders on a Finite Set
• Boolean lattices: Ramsey properties and embeddings
• Induced and non-induced forbidden subposet problems
• Largest family without \(A \cup B \subseteq C \cap D\)
• Maximum antichains in random subsets of a finite set
• Maximum-size antichains in random set-systems
• On crown-free families of subsets
• Progress on poset-free families of subsets
• Ramsey theory for discrete structures
• Random graphs with monochromatic triangles in every edge coloring
• Set families with a forbidden subposet
• Small sublattices in random subsets of Boolean lattices
• Sperner type theorems with excluded subposets
• The height of a random partial order: Concentration of measure
• The length of random subsets of Boolean lattices
• The width of random subsets of Boolean lattices
• Threshold Functions for Ramsey Properties
• Two poset polytopes
• \(Q _{2}\)-free families in the Boolean lattice

Cited in

(9)

• First order properties of random posets
• scientific article; zbMATH DE number 524135 (Why is no real title available?)
• Poset Ramsey number \(R(P,Q_n)\). I: Complete multipartite posets
• Poset Ramsey number \(R(P,Q_n)\). II: \(\mathrm{N}\)-shaped poset
• Poset Ramsey numbers: large Boolean lattice versus a fixed poset
• scientific article; zbMATH DE number 5124733 (Why is no real title available?)
• Existence theorems for measures on continous posets, with applications to random set theory.
• Rectilinear approximation and volume estimates for hereditary bodies via [0, 1]‐decorated containers
• A construction for Boolean cube Ramsey numbers

This page was built for publication: Existence thresholds and Ramsey properties of random posets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3386529)