Steiner pentagon systems (Q800362)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Steiner pentagon systems |
scientific article |
Statements
Steiner pentagon systems (English)
0 references
1984
0 references
A Steiner pentagon system is a partition of the complete graph \(K_ n\) into pentagons such that each pair of distinct vertices is joined by a path of length two in exactly one of the pentagons. Such systems give rise to quasigroups (in a manner similar to the construction of Steiner quasigroups from Steiner triple systems). The authors show that a Steiner pentagon system exists precisely for all \(n\equiv 1\) or 5 mod 10, with the exception \(n=15\). Their construction uses perpendicular arrays and self-orthogonal latin squares with symmetric mate.
0 references
Steiner pentagon system
0 references
perpendicular arrays
0 references
self-orthogonal latin squares
0 references
0 references
0 references