Intersections of k-element sets
From MaRDI portal
Publication:1166522
DOI10.1007/BF02579460zbMath0489.05005OpenAlexW2025565016MaRDI QIDQ1166522
James B. Shearer, Daniel J. Kleitman, Dean G. Sturtevant
Publication date: 1981
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02579460
Related Items
On the independence number of sparse graphs, Covering small subgraphs of (hyper)tournaments with spanning acyclic subgraphs, Families of finite sets in which no set is covered by the union of two others, Notes on use of generalized entropies in counting, Exhaustive testing of almost all devices with outputs depending on limited number of inputs, Union-free hypergraphs and probability theory, A construction for large families of k-element sets having the Erdős intersection property, Explicit construction of exponential sized families of k-independent sets
Cites Work
