scientific article; zbMATH DE number 3230288

Cited in

(39)

Stronger form of an M-part Sperner theorem
A Ramsey-Sperner theorem
k-color Sperner theorems
All maximum 2-part Sperner families
Convex hulls of more-part Sperner families
On counting Sperner families
The Littlewood-Offord problem: Tightest packing and an M-part Sperner theorem
Sperner's theorem on maximal-sized antichains and its generalization
A three part Sperner theorem
Some new results on the Littlewood-Offord problem
Strong versions of Sperner's theorem
Skew chain orders and sets of rectangles
Applications of the symmetric chain decomposition of the lattice of divisors
Ramsey-Sperner theory
Extremal problems among subsets of a set
Majorization and Rényi entropy inequalities via Sperner theory
The Littlewood-Offord problem in high dimensions and a conjecture of Frankl and Füredi
AZ-identities and strict 2-part Sperner properties of product posets
Extremal problems among subsets of a set. (Reprint)
On a lemma of Littlewood and Offord on the distributions of linear combinations of vectors
A generalization of results of P. Erdős, G. Katona, and D. J. Kleitman concerning Sperner's theorem
How many sums of vectors can lie in a circle of diameter 2?
A generalization of some generalizations of Sperner's theorem
On two-part Sperner systems for regular posets (extended abstract)
Applications of graph containers in the Boolean lattice
A sharp inverse Littlewood-Offord theorem
Quantitative invertibility of random matrices: a combinatorial perspective
Erdös Conjecture on Sums of Distinct Numbers
Semiantichains and Unichain Coverings in Direct Products of Partial Orders
Inverse Littlewood-Offord problems and the singularity of random symmetric matrices
A general 2-part Erdős-Ko-Rado theorem
On the distribution of sums of residues
Hamiltonian cycles and symmetric chains in Boolean lattices.
From the Littlewood-Offord problem to the Circular Law: Universality of the spectral distribution of random matrices
A tour of \(M\)-part \(L\)-Sperner families
A discrete variation of the Littlewood-Offord problem
Optimal inverse Littlewood-Offord theorems
The singularity probability of a random symmetric matrix is exponentially small
The number of symmetric chain decompositions

This page was built for publication:

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