Configurations containing a given linear hypergraph
Abstract:
We investigate the minimum order of a linear r‐regular k‐uniform hypergraph, also known as an ‐combinatorial configuration, which contains a given linear k‐uniform hypergraph of maximum (vertex) degree at most r.