Configurations Containing a Given Linear Hypergraph

We investigate the minimum order of a linear r-regular k-uniform hypergraph, also known as an [r, k]-combinatorial configuration, which contains a given linear k-uniform hypergraph of maximum (vertex) degree at most r.