Asymptotic existence theorems for frames and group divisible designs

Authors:
Jiuqiang Liu
Affiliations:
Center for Combinatorics, Nankai University, Tianjin, PR China and Department of Mathematics, Eastern Michigan University, Ypsilanti, MI 48197, USA
Venue:
Journal of Combinatorial Theory Series A
Year:
2007

Citing 4
Cited 1

Theory of linear and integer programming

Theory of linear and integer programming
Frames for Kirkman triple systems

Discrete Mathematics
Decompositions of edge-colored complete graphs

Journal of Combinatorial Theory Series A
An existence theorem for group divisible designs of large order

Journal of Combinatorial Theory Series A

The asymptotic existence of group divisible designs of large order with index one

Journal of Combinatorial Theory Series A

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we establish an asymptotic existence theorem for group divisible designs of type m^n with block sizes in any given set K of integers greater than 1. As consequences, we will prove an asymptotic existence theorem for frames and derive a partial asymptotic existence theorem for resolvable group divisible designs.