The spectrum of ?-resolvable designs with block size four

  title={The spectrum of ?-resolvable designs with block size four},
  author={Troy Vasiga and Steven Furino and Alan C. H. Ling},
  journal={Journal of Combinatorial Designs},
Abstact: An α-resolvable BIBD is a BIBD with the property that the blocks can be partitioned into disjoint classes such that every class contains each point of the design exactly α times. In this paper, we show that the necessary conditions for the existence of α-resolvable designs with block size four are sufficient, with the exception of (α, ν, λ) = (2, 10, 2). © 2000 John Wiley & Sons, Inc. J Combin Designs 9: 1–16, 2001 
The spectrum of α-resolvable λ-fold (K_4 - e)-designs
The α -resolvability for λ -fold ( K 4  −  e ) -designs is studied and it is proved that the necessary conditions for their existence are also sufficient, without any exception.
α-Resolvable Cycle Systems for Cycle Length 4
An m-cycle system of order v and index λ, denoted by m-CS(v,λ), is a collection of cycles of length m whose edges partition the edges of λKv. An m-CS(v,λ) is α-resolvable if its cycles can be
Characterization and existence of affine α-resolvable block designs
-resolvable balanced incompleteblock or 2-associate partially balanced incomplete block designs and to havea Ph.D. Thesis by Satoru Kadowaki. In fact, Sections 3, 4 and 5 of the thesisare based on
On α-resolvable directed cycle systems for cycle length 4
It is shown in this paper that the necessary conditions for the existence of such a design are m | αv and α | λ(v−1) and that these conditions are also sufficient when m = 4, except for the case v =4, λ ≡ 1 (mod 2).
Thickly-resolvable block designs
We show that the necessary divisibility conditions for the existence of a -resolvable BIBD(v;k; ) are sucient for large v. The key idea is
Constructions of Optimal and Near-Optimal Multiply Constant-Weight Codes
Multiply constant-weight codes (MCWCs) have been recently studied to improve the reliability of certain physically unclonable function response. In this paper, we give combinatorial constructions for
Fixed block configuration GDDs with block size 6 and (3,r)-regular graphs
Chapter 1 is used to introduce the basic tools and mechanics used within this thesis. Most of the definitions used in the thesis will be defined, and we provide a basic survey of topics in graph


Block designs with large holes and α -resolvable BIBDs
In a (v, k, λ: w) incomplete block design (IBD) (or PBD [v, {k, w*}. λ]), the relation v ≥ (k − 1)w + 1 must hold. In the case of equality, the IBD is referred to as a block design with a large hole,
Resolvable bibd and sols
Frames and Resolvable Designs: Uses, Constructions and Existence
Introduction The Rules The Games Latin Squares Group Divisible Designs Experimental Designs Problems Projects Frame Constructions Definitions Necessary Conditions Frames and Other Types of Designs
Difference families from rings
Frames with Block Size Four
Abstract We investigate the spectrum for frames with block size four, and discuss several applications to the construction of other combinatorial designs. Our main result is that a frame of type hu,
CRC Handbook of Combinatorial Designs
Balanced Incomplete Block Designs and t-Designs2-(v,k,l) Designs of Small OrderBIBDs with Small Block Sizet-Designs, t = 3Steiner SystemsSymmetric DesignsResolvable and Near Resolvable DesignsLatin