Blocking Sets in \(G\)-designs

Saad I.El-Zanati1, C.A. Rodger 1
1Department of Algebra, Combinatorics, and Analysis Auburn University Aubum, Alabama 36849-5307 US.A.

Abstract

We give necessary and sufficient conditions for the existence of 2-colorable \(G\)-designs for each \(G\) that is connected, simple and has at most 5 edges.