scientific article; zbMATH DE number 1792287
From MaRDI portal
Publication:4552141
zbMATH Open0995.05001MaRDI QIDQ4552141FDOQ4552141
Authors: Ian Anderson 
Publication date: 29 August 2002
Title of this publication is not available (Why is that?)
Recommendations
Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Hypergraphs (05C65) Combinatorial inequalities (05A20) Extremal set theory (05D05)
Cited In (38)
- Dominating circuits in regular matroids
- Nonhomogeneous analytic families of trees
- Projection inequalities for antichains
- Formalising the Kruskal-Katona theorem in Lean
- A heuristic technique for decomposing multisets of non-negative integers according to the Minkowski sum
- Combinatorics in the exterior algebra and the Bollobás two families theorem
- All binomial identities are orderable
- Partial covering arrays and a generalized Erdős-Ko-Rado property
- On Whitney numbers of the order ideals of generalized fences and crowns
- The normalized matching property in random and pseudorandom bipartite graphs
- A continuous analogue of Erdős' \(k\)-Sperner theorem
- An Erdős-Gallai theorem for matroids
- A Safe Computational Framework for Integer Programming Applied to Chvátal’s Conjecture
- Some remarks on nestings in the normalized matching posets of rank 3
- The necklace poset is a symmetric chain order
- On the covering number of small symmetric groups and some sporadic simple groups.
- Minimum weight flat antichains of subsets
- Abelian primitive words
- The EGH conjecture and the Sperner property of complete intersections
- A new matching property for posets and existence of disjoint chains
- Semi-distance codes and Steiner systems
- A combinatorial approach to the number of solutions of systems of homogeneous polynomial equations over finite fields
- Intersecting families of polynomials over finite fields
- Avoiding brooms, forks, and butterflies in the linear lattices
- Methods for nesting rank 3 normalized matching rank-unimodal posets
- Symmetric decompositions and the strong Sperner property for noncrossing partition lattices
- A Kruskal-Katona type result and applications
- The generalized Füredi conjecture holds for finite linear lattices
- On the maximum number of translates in a point set
- Symmetric chain decompositions and the strong Sperner property for noncrossing partition lattices
- Two characterizations of the dense rank
- Extremal problems concerning ordered intersections of sets
- On Bernoulli decompositions for random variables, concentration bounds, and spectral localization
- Enumerating \(S_n\) by associated transpositions and linear extensions of finite posets
- Analogues of the Smale and Hirsch theorems for cooperative Boolean and other discrete systems
- Notes on introductory combinatorics
- Number theoretic correlation inequalities for Dirichlet densities
- The saturation spectrum for antichains of subsets
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 Q4552141)
