scientific article; zbMATH DE number 3256524

zbMATH Open0159.30401MaRDI QIDQ5542810FDOQ5542810

Authors: Daniel J. Kleitman 

Publication date: 1968

Title of this publication is not available (Why is that?)

zbMATH Keywords

combinatorics

Cited In (21)

• The largest projective cube-free subsets of \(\mathbb{Z}_{2^n}\)
• Solution to a problem of Katona on counting cliques of weighted graphs
• Set systems containing many maximal chains
• Structure and supersaturation for intersecting families
• Colouring set families without monochromatic \(k\)-chains
• Kleitman's conjecture about families of given size minimizing the number of \(k\)-chains
• On the number of \(K_4\)-saturating edges
• Search problems for two irregular coins with incomplete feedback: The underweight model
• A random version of Sperner's theorem
• Families in posets minimizing the number of comparable pairs
• Extremal problems among subsets of a set
• The sparse sequences of graphs
• Supersaturation in posets and applications involving the container method
• Comparable pairs in families of sets
• On the number of monotone sequences
• Supersaturation and stability for forbidden subposet problems.
• Subsets of posets minimising the number of chains
• Sperner's theorem and a problem of Erdős, Katona and Kleitman
• A generalization of the independence number
• The number of additive triples in subsets of abelian groups
• Randomized group testing both query-optimal and minimal adaptive

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 Q5542810)