Resolvable Group Divisible Designs with Large Groups
Copyright policy )Resolvable Group Divisible Designs with Large Groups
We prove that the necessary divisibility conditions are sufficient for the existence of resolvable group divisible designs with a fixed number of sufficiently large groups. Our method combines an application of the Rees product construction with a streamlined recursion based on incomplete transversal designs. With similar techniques, we also obtain new results on decompositions of complete multipartite graphs into a prescribed graph.
- University of Victoria Canada
- University of Victoria Canada
transversal design, Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.), Graph designs and isomorphic decomposition, resolvability, graph decomposition, Other designs, configurations
transversal design, Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.), Graph designs and isomorphic decomposition, resolvability, graph decomposition, Other designs, configurations
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).0 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Average impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!