An extremal problem in the uniform covering of finite sets

DOI10.1016/0097-3165(72)90025-8zbMATH Open0244.05004OpenAlexW2028115606MaRDI QIDQ2554698FDOQ2554698

Authors: Gustavus J. Simmons 

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)90025-8

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Other combinatorial set theory (03E05) Combinatorial aspects of packing and covering (05B40)

Cites Work

• Title not available (Why is that?)
• Parallel concepts in graph theory
• Title not available (Why is that?)
• Some Results Concerning the Occurrence of Specified Prime Factors in \binommr

Cited In (2)

• Some balanced complete block designs
• On uniform covers and t-designs

This page was built for publication: An extremal problem in the uniform covering of finite sets

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