A characterization of separating distinguished collections containing the maximum number of sets

DOI10.1016/0097-3165(72)90013-1zbMath0255.04003OpenAlexW1989353495MaRDI QIDQ2558221

J. Shalhevet

Publication date: 1972

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(72)90013-1

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Permutations, words, matrices (05A05) Other combinatorial set theory (03E05)

Cites Work

• Unnamed Item
• A characterization, existence proof and dimension bounds for the kernel of a game
• On Minimal Separating Collections

This page was built for publication: A characterization of separating distinguished collections containing the maximum number of sets