Publication:1570763

DOI10.1006/JCTA.1999.3048zbMATH Open0949.05084OpenAlexW2003315074MaRDI QIDQ1570763FDOQ1570763

Deryk Osthus

Publication date: 29 November 2000

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jcta.1999.3048

zbMATH Keywords

Sperner theoremrandom posetchain covers

Mathematics Subject Classification ID

Extremal set theory (05D05)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Poisson approximation for large deviations
• A short proof of Sperner's lemma
• The width of random subsets of Boolean lattices
• Small sublattices in random subsets of Boolean lattices
• The length of random subsets of Boolean lattices

Cited In (12)

• Existence thresholds and Ramsey properties of random posets
• The length of random subsets of Boolean lattices
• On Erdős–Ko–Rado for Random Hypergraphs II
• A random version of Sperner's theorem
• Antichains and Finite Sets that Meet all Maximal Chains
• Maximal and maximum antichains of ordered multisets
• The width of random subsets of Boolean lattices
• The largest super-increasing subset of a random set
• Maximum-size antichains in random set-systems
• On some extremal and probabilistic questions for tree posets
• Counting maximal antichains and independent sets
• Improved bounds for cross-Sperner systems

This page was built for publication: Maximum antichains in random subsets of a finite set

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