Tight blocking sets in some maximum packings of \(\lambda K_n\) (Q2468030)

In a \((\lambda K_n,G)\) maximum packing (whose subgraphs are all morphic to \(G\)), a subset \(T\) of the vertex set \(X\) is called a blocking set if each subgraph contains a vertex in both \(T\) and \(X\setminus T\). Such a blocking set is called tight if the edge-leave graph of the maximum packing can be partitioned into corrected components \(L_1,L_2,\dots, L_a\), and the vertex set of ech \(L_i\) \((1\leq i\leq a)\) contains at least one point in both \(T\) and \(X\setminus T\). The authors consider 2 cases: where \(G= K_3\), and where \(G\) is the kite graph with 4 edges on 4 vertices. For \(G= K_3\), they show that a blocking set can exist only when either (1) \(n= 4\), \(\lambda\) is odd or (2) \(n= 5\), \(\lambda\in\{1,2,4\}\) or (3) \(n\in \{6,8\}\), \(\lambda= 1\), while a tight blocking set can exist only when either (1) \(n= 4\), \(\lambda\) is odd or (2) \(n= 5\), \(\lambda= 1\). When \(G\) is the kite graph, the authors show a tight blocking set \(T\) exists (for all \(n\), \(\lambda\) and all feasible edge leave graphs). They leave open the problem of determining all feasible numbers of points in \(T\) here (for given \(n\), \(\lambda\) and all feasible edge-leave graphs).