Minimal completely separating systems of \(k\)-sets

DOI10.1006/jcta.2000.3071zbMath0979.05102OpenAlexW2053011208MaRDI QIDQ5929844

Dhruv Mubayi, Prasad Tetali, André Kündgen

Publication date: 17 February 2002

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

Full work available at URL: https://doi.org/10.1006/jcta.2000.3071

zbMATH Keywords

antichainBaranyai's theoremextremal set theoryseparating familyuniform hypergraph

Mathematics Subject Classification ID

Extremal set theory (05D05)

Related Items (4)

Separating systems and oriented graphs of diameter two ⋮ On separating systems ⋮ Bipartite Hansel results for hypergraphs ⋮ Inclusionwise minimal completely separating systems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On separating systems whose elements are sets of at most k elements
• On a problem of Katona on minimal completely separating systems with restrictions
• Completely separating systems of \(k\)-sets
• On the average size of the sets in a Sperner family
• On separating systems of a finite set
• Minimal completely separating systems
• On a problem concerning separating systems of a finite set

This page was built for publication: Minimal completely separating systems of \(k\)-sets