Existence thresholds and Ramsey properties of random posets
From MaRDI portal
Publication:3386529
DOI10.1002/RSA.20952zbMATH Open1454.05122arXiv1910.00485OpenAlexW3047662601MaRDI QIDQ3386529FDOQ3386529
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)
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 .
Full work available at URL: https://arxiv.org/abs/1910.00485
Recommendations
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Two poset polytopes
- Asymptotic Enumeration of Partial Orders on a Finite Set
- Maximum-size antichains in random set-systems
- The height of a random partial order: Concentration of measure
- A random version of Sperner's theorem
- Threshold Functions for Ramsey Properties
- Ramsey theory for discrete structures
- Title not available (Why is that?)
- Title not available (Why is that?)
- Random graphs with monochromatic triangles in every edge coloring
- Set families with a forbidden subposet
- Largest family without \(A \cup B \subseteq C \cap D\)
- Sperner type theorems with excluded subposets
- \(Q _{2}\)-free families in the Boolean lattice
- Maximum antichains in random subsets of a finite set
- The width of random subsets of Boolean lattices
- Small sublattices in random subsets of Boolean lattices
- The length of random subsets of Boolean lattices
- Title not available (Why is that?)
- On crown-free families of subsets
- Title not available (Why is that?)
- Induced and non-induced forbidden subposet problems
- An upper bound on the size of diamond-free families of sets
- Progress on poset-free families of subsets
- Applications of graph containers in the Boolean lattice
- Boolean lattices: Ramsey properties and embeddings
Cited In (9)
- First order properties of random posets
- Title not available (Why is that?)
- Rectilinear approximation and volume estimates for hereditary bodies via [0, 1]‐decorated containers
- Poset Ramsey number \(R(P,Q_n)\). I: Complete multipartite posets
- Poset Ramsey number \(R(P,Q_n)\). II: \(\mathrm{N}\)-shaped poset
- A construction for Boolean cube Ramsey numbers
- Poset Ramsey numbers: large Boolean lattice versus a fixed poset
- Title not available (Why is that?)
- Existence theorems for measures on continous posets, with applications to random set theory.
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)