Publication:4552141

zbMath0995.05001MaRDI QIDQ4552141

Ian Anderson

Publication date: 29 August 2002

zbMATH Keywords

Erdős-Ko-Rado theorem; extremal set theory; Kruskal-Katona theorem; Sperner lemma; finite combinatorics

Mathematics Subject Classification ID

05-02: Research exposition (monographs, survey articles) pertaining to combinatorics

05C65: Hypergraphs

05A20: Combinatorial inequalities

05D05: Extremal set theory

Related Items

ABELIAN PRIMITIVE WORDS, Unnamed Item, Combinatorics in the exterior algebra and the Bollobás Two Families Theorem, A Combinatorial Approach to the Number of Solutions of Systems of Homogeneous Polynomial Equations over Finite Fields, Nonhomogeneous analytic families of trees, A Safe Computational Framework for Integer Programming Applied to Chvátal’s Conjecture, A heuristic technique for decomposing multisets of non-negative integers according to the Minkowski sum, Formalising the Kruskal-Katona theorem in Lean, On the covering number of small symmetric groups and some sporadic simple groups., Dominating circuits in regular matroids, An Erdős-Gallai theorem for matroids, Number theoretic correlation inequalities for Dirichlet densities, All binomial identities are orderable, Avoiding brooms, forks, and butterflies in the linear lattices, On the maximum number of translates in a point set, The generalized Füredi conjecture holds for finite linear lattices, On Bernoulli decompositions for random variables, concentration bounds, and spectral localization, The necklace poset is a symmetric chain order, Methods for nesting rank 3 normalized matching rank-unimodal posets, On Whitney numbers of the order ideals of generalized fences and crowns, Enumerating \(S_n\) by associated transpositions and linear extensions of finite posets, A new matching property for posets and existence of disjoint chains, The normalized matching property in random and pseudorandom bipartite graphs, Projection inequalities for antichains, Some remarks on nestings in the normalized matching posets of rank 3, A continuous analogue of Erdős' \(k\)-Sperner theorem, A Kruskal-Katona type result and applications, Semi-distance codes and Steiner systems, Symmetric decompositions and the strong Sperner property for noncrossing partition lattices, Minimum weight flat antichains of subsets, The EGH Conjecture and the Sperner property of complete intersections, Analogues of the Smale and Hirsch theorems for cooperative Boolean and other discrete systems, Partial covering arrays and a generalized Erdös-Ko-Rado property