On Kruskal's cascades and counting containments in a set of subsets

DOI10.1112/S0025579300010470zbMath0527.05002MaRDI QIDQ3043155

Peter Frankl, David E. Daykin

Publication date: 1983

Published in: Mathematika (Search for Journal in Brave)

zbMATH Keywords

set of subsetsmaximum number of containments

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Permutations, words, matrices (05A05)

Related Items (2)

Comparable pairs in families of sets ⋮ The maximum number of disjoint pairs in a family of subsets

Cites Work

• A simple proof of the Kruskal-Katona theorem
• Graphs with maximal number of adjacent pairs of edges
• Inequalities for Subsets of a Set and KLYM Posets
• Optimal numberings and isoperimetric problems on graphs
• Some Results on Matching in Bipartite Graphs
• Optimal Assignments of Numbers to Vertices

This page was built for publication: On Kruskal's cascades and counting containments in a set of subsets