On the number of latent subsets of intersecting collections

DOI10.1016/0097-3165(74)90046-6zbMath0281.05003OpenAlexW2062099829WikidataQ89214527 ScholiaQ89214527MaRDI QIDQ1843569

Daniel J. Kleitman, Thomas L. Magnanti

Publication date: 1974

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0097-3165(74)90046-6

Mathematics Subject Classification ID

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

Related Items (7)

Latent Subsets for Dual Intersecting Systems ⋮ A new result on Chvátal's conjecture ⋮ Some results about the Chvatal conjecture ⋮ On systems of finite sets with constraints on their unions and intersections ⋮ Short proof of two cases of Chvátal's conjecture ⋮ Great intersecting families of edges in hereditary hypergraphs ⋮ On conjectures of Berge and Chvátal

Cites Work

• On a conjecture of milner on k-graphs with non-disjoint edges

This page was built for publication: On the number of latent subsets of intersecting collections