OpenAlex
Asymptotic Existence of Resolvable Graph Designs
Work
Year: 2007
Type: article
Abstract: Let v ≥ k ≥ 1 and λ ≥ 0 be integers. A block design BD( v , k , λ) is a collection of k -subsets of a v -set X in which every unordered pair of elements from X is contained in exactly λ elements of .... more
Cites: 10
Cited by: 24
Related to: 10
FWCI: 0.289
Citation percentile (by year/subfield): 82.4
Open Access status: bronze