The intersection problem for kite-GDDs-Reference-Cited by-同舟云学术

The intersection problem for kite-GDDs

Published:2023 Issue:7 Volume:37 Page:2227-2236
ISSN:0354-5180
Container-title:Filomat
language:en
Short-container-title:Filomat

Author:

Zhang Guizhi¹,An Yonghong²

Affiliation:

1. School of Mathematics and Statistics, Hulunbuir University, Hulunbuir, P.R. China

2. College of Continuing Education, Hulunbuir University, Hulunbuir, P.R. China

Abstract

In this paper the intersection problem for a pair of kite-GDDs of type 4u is investigated. The intersection problem for kite-GDDs is the determination of all pairs (T, s) such that there exists a pair of kite-GDDs (X,H,B1) and (X,H,B2) of the same type T and |B1?B2| = s. Let J(u) = {s : ? a pair of kite-GDDs of type 4u intersecting in s blocks}; I(u) = {0, 1,..., bu ? 2, bu}, where bu = 2u(u ? 1) is the number of blocks of a kite-GDD of type 4u. We show that for any positive integer u ? 3, J(u) = I(u).

Publisher

National Library of Serbia

Subject

General Mathematics

Reference18 articles.

1. E. J. Billington and D. L. Kreher, The intersection problem for small G-designs, Australas. J. Combin., 12 (1995), 239-258.

2. R. A. R. Butler and D. G. Hoffman, Intersections of group divisible triple systems, Ars Combin, 34(1992), 268-288.

3. Y. Chang, T. Feng, and G. Lo Faro, The triangle intersection problem for S(2, 4, v) designs, Discrete Math., 310(2010), 3194-3205.

4. Y. Chang, T. Feng, G. Lo Faro, and A. Tripodi, The fine triangle intersection problem for kite systems, Discrete Math., 312(2012), 545-553.

5. Y. Chang, T. Feng, G. Lo Faro, and A. Tripodi, Enumerations of (K4 − e)-designs with small orders, Quaderni di Matematica (special volume to the memory of Lucia Gionfriddo), in press.