Intersections of k-element sets

DOI10.1007/BF02579460zbMATH Open0489.05005OpenAlexW2025565016MaRDI QIDQ1166522FDOQ1166522

Authors: Daniel J. Kleitman, James B. Shearer, 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

zbMATH Keywords

collection of sets

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Extremal problems in graph theory (05C35) Hypergraphs (05C65)

Cites Work

• Title not available (Why is that?)

Cited In (8)

• On the independence number of sparse graphs
• Families of finite sets in which no set is covered by the union of two others
• Union-free hypergraphs and probability theory
• A construction for large families of k-element sets having the Erdős intersection property
• Exhaustive testing of almost all devices with outputs depending on limited number of inputs
• Notes on use of generalized entropies in counting
• Covering small subgraphs of (hyper)tournaments with spanning acyclic subgraphs
• Explicit construction of exponential sized families of k-independent sets

This page was built for publication: Intersections of k-element sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1166522)