Counting configurations in designs
Journal of Combinatorial Theory, Series A
Mathematics and Computer Science
Given a t-(v, k, ?) design, form all of the subsets of the set of blocks. Partition this collection of configurations according to isomorphism and consider the cardinalities of the resulting isomorphism classes. Generalizing previous results for regular graphs and Steiner triple systems, we give linear equations relating these cardinalities. For any fixed choice of t and k, the coefficients in these equations can be expressed as functions of v and ? and so depend only on the design's parameters, and not its structure. This provides a characterization of the elements of a generating set for m-line configurations of an arbitrary design.
Beezer, Robert. "Counting Configurations in Designs." Journal of Combinatorial Theory, Series a. 96.2 (2001): 341-357. Print.