Article ID Journal Published Year Pages File Type
4650298 Discrete Mathematics 2007 8 Pages PDF
Abstract

In this paper a method of enumeration for n-balanced, labelled, minimum covers of a finite set of m indistinguishable elements is developed. The method is then used to tabulate the number of such covers for small values of m and n by means of a generating function.

Keywords
Related Topics
Physical Sciences and Engineering Mathematics Discrete Mathematics and Combinatorics
Preview
Balanced minimum covers of a finite set
Authors
, ,