scientific article; zbMATH DE number 1394635
A \(G\)-design of \(K_{v}\) of order \(v\) is a pair \((V,B)\) where \(V\) is the vertex set of \(K_{v}\) and \(B\) is a decomposition of the edge set of \(K_{v}\) into edge-disjoint copies of \(G\). Such a design is said to have no proper subsystem if there does not exist a \(G\)-design \((W,Q)\) where \(W \subset V\) and \(Q \subset B\). A covering of \(K_{v}\) with copies of \(G\) is an ordered triple \((V,B,P)\) where \(V\) is the vertex set of \(K_{v}\), \(B\) is a collection of edge-disjoint copies of \(G\) which partition \(E(K_{v}) \cup P\) where \(P \subseteq E(\lambda K_{v})\). The covering is minimum if \(|P|\) is least, and is a \(G\)-design if \(P=\varnothing \). In this paper, the authors prove that minimum coverings of \(K_{v}\) with copies of \(K_{4}-e\) which contain no proper subsystems exist if and only if \(v\not\in \{2,3,10\}\). The proof is split into two cases: \(v\equiv 6\pmod {10}\) and the rest. Use is made of the existence of idempotent commutative quasigroups \((X,\circ)\) of order \(2k+1\) for all \(k\), (for the first case), and of commutative quasigroups \((X, \circ)\) with holes of size 2 of order \(2k\geq 6\) (for the second case). Detailed constructions are given and for some values of \(v\), reference to the two URLs where the details are put up is given.
- Minimum resolvable coverings of \(K_{v}\) with copies of \(K_{4}-e\)
- scientific article; zbMATH DE number 1123811
- Simple minimum coverings of \(K_n\) with copies of \(K_4 -e\)
- Simple minimum (\(K_4 - e\))-coverings of complete multipartite graphs
- Minimum complementary P₃-coverings of K_v
- scientific article; zbMATH DE number 2192087
- Minimal covers of \(Q^+(2n+1,q)\) by \((n-1)\)-dimensional subspaces
- scientific article; zbMATH DE number 26498
- Minimal completely separating systems of \(k\)-sets
- scientific article; zbMATH DE number 4214002
- Simple minimum (\(K_4 - e\))-coverings of complete multipartite graphs
- Systems S(2,4,v) with exactly one or without any maximal subsystem
- Simple minimum coverings of \(K_n\) with copies of \(K_4 -e\)
- Maximum packings of K_v with copies of P₃ which contain no proper subsystems
- Primitive C4 ${C}_{4}$‐decompositions of Kn−I ${K}_{n}-I$
- Primitive cycle decompositions of Kn and Kn−I
- 2-primitive \(C_3\)-decompositions of cocktail party graphs
- Minimum resolvable coverings of \(K_{v}\) with copies of \(K_{4}-e\)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4934837)
