A sharp threshold for a random version of Sperner's theorem

DOI10.1002/RSA.21259MaRDI QIDQ7027481zbMATH OpenFDO

Authors József Balogh, Robert A. Krueger

Publication date 14 February 2025

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

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1002/RSA.21259

zbMATH Keywords

graph container methodrandom posetSperner's theorem

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Extremal set theory (05D05) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40) Combinatorics of partially ordered sets (06A07) Lattices (06B99)

Cites work

• A random version of Sperner's theorem
• Combinatorial theorems in sparse random sets
• Ein Satz über Untermengen einer endlichen Menge.
• Erdős-Ko-Rado in random hypergraphs
• Extremal results for random discrete structures
• Extremal results in random graphs
• Homomorphisms from the torus
• scientific article; zbMATH DE number 3833857 (Why is no real title available?)
• scientific article; zbMATH DE number 4160792 (Why is no real title available?)
• scientific article; zbMATH DE number 3825713 (Why is no real title available?)
• scientific article; zbMATH DE number 3489128 (Why is no real title available?)
• scientific article; zbMATH DE number 487720 (Why is no real title available?)
• scientific article; zbMATH DE number 3223273 (Why is no real title available?)
• scientific article; zbMATH DE number 3189757 (Why is no real title available?)
• Hypergraph containers
• Independent sets in hypergraphs
• Independent sets in the hypercube revisited
• Independent sets in the middle two layers of Boolean lattice
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• Maximum antichains in random subsets of a finite set
• Maximum-size antichains in random set-systems
• Note on the number of balanced independent sets in the Hamming cube
• On a lemma of Littlewood and Offord
• On Erdős-Ko-Rado for random hypergraphs. II
• On Phase Transition in the Hard-Core Model on ${\mathbb Z}^d$
• On the decomposition of numbers by means of their greatest common divisors.
• On the sizes of \(t\)-intersecting \(k\)-chain-free families
• Sharp threshold for the Erdős–Ko–Rado theorem
• The length of random subsets of Boolean lattices
• The width of random subsets of Boolean lattices

Cited in

(3)

• Lipschitz functions on weak expanders
• Counting independent sets in percolated graphs via the Ising model
• On Dedekind's problem, a sparse version of Sperner's theorem, and antichains of a given size in the Boolean lattice

This page was built for publication: A sharp threshold for a random version of Sperner's theorem

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