Graph designs for all graphs with six vertices and eight edges (Q2508041)

Let \(G\) be a finite simple graph. A \(G\)-design of order \(v\), denoted by \(G\)-\(GD(v)\), is a pair \((X,{\mathcal B})\), where \(X\) is the vertex set of the complete graph \(K_v\), and \(\mathcal B\) is a collection of subgraphs of \(K_v\), called blocks, such that each block is isomorphic to \(G\) and any two distinct vertices in \(K_v\) are adjacent in exactly one block. The obvious necessary conditions for the existence of a \(G\)-\(GD(v)\) are \(v\geq n\), \(v(v-1)\equiv0\;(\text{mod\;}2e)\), and \(v-1\equiv0\;(\text{mod\;}d)\), where \(n\) and \(e\) are the number of vertices and edges of \(G\), respectively, and \(d\) is the greatest common divisor of the degrees of all vertices in \(G\). The question, whether a \(G\)-\(GD(v)\) exists whose parameters \(v\), \(n\), \(e\), \(d\) satisfy the above necessary conditions, is called the ``graph design problem''. Such a problem has been answered for particular graphs, and in most cases for \(n\leq5\) or \(n=6\) and \(e\leq7\). In this paper, the graph design problem is affirmatively answered for all \(22\) graphs with parameters \(n=6\) and \(e=8\), with at most two exceptions when \(v=32\).