Minimal covers of finite sets

DOI10.1016/0012-365X(73)90141-6zbMath0262.05007OpenAlexW1988508329MaRDI QIDQ2560822

Thomas M. Hearne, Carl G. Wagner

Publication date: 1973

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(73)90141-6

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Permutations, words, matrices (05A05) Other designs, configurations (05B30)

Related Items (9)

Extremal problems for ordered hypergraphs: small patterns and some enumeration ⋮ Unnamed Item ⋮ A CORRECTNESS PROOF FOR AL-BARAKĀT’S LOGICAL DIAGRAMS ⋮ A characterization of moral transitive acyclic directed graph Markov models as labeled trees. ⋮ A lattice-based forward secure IBE scheme for Internet of things ⋮ Covering a set by subsets ⋮ Balanced minimum covers of a finite set ⋮ Minimal multiplicative covers of an integer ⋮ Frame cellular automata: Configurations, generating sets and related matroids

Cites Work

• Unnamed Item

This page was built for publication: Minimal covers of finite sets