论文信息 - A note on uniformly resolvable decompositions of Kv and Kv-I into 2-stars and 4-cycles

A note on uniformly resolvable decompositions of Kv and Kv-I into 2-stars and 4-cycles

In this paper we consider the uniformly resolvable decomposition of the complete graph Kv, or the complete graph minus a 1-factor Kv − I, into two graphs such that each resolution class contains only blocks isomorphic to the same graph. We completely solve the case in which the resolution classes are either all 2-stars or 4-cycles.

Salvatore Milici | Salvatore Milici

[1] Robert Winter,et al. Dimensional crossover in Sr2RuO4 within a slave-boson mean-field theory , 2008, 0812.3731.

[2] Alan C. H. Ling,et al. Maximum uniformly resolvable designs with block sizes 2 and 4 , 2009, Discret. Math..

[3] Douglas R. Stinson,et al. On resolvable group-divisible designs with block size 3 , 1987 .

[4] C. Colbourn,et al. Handbook of Combinatorial Designs , 2006 .

[5] C. Lindner,et al. Design Theory, Second Edition , 2008 .

[6] Ernst Schuster. Uniformly resolvable designs with index one and block sizes three and four - with three or five parallel classes of block size four , 2009, Discret. Math..

[7] Alan Hartman,et al. Resolvable group divisible designs with block size 3 , 1989, Discret. Math..

[8] Brett Stevens,et al. The Hamilton–Waterloo problem for cycle sizes 3 and 4 , 2009 .

[9] Joseph Douglas Horton. Resolvable Path Designs , 1985, J. Comb. Theory, Ser. A.

[10] Ernst Schuster,et al. Author's Personal Copy Discrete Mathematics , 2022 .

[11] Kazuhiko Ushio. P3-Factorization of complete bipartite graphs , 1988, Discret. Math..

[12] Rolf S. Rees,et al. Uniformly resolvable pairwise balanced designs with blocksizes two and three , 1987, J. Comb. Theory, Ser. A.