Graph factorization,general triple systems,and cyclic triple systems |
| |
| Authors: | R G Stanton I P Goulden |
| |
| Institution: | (1) Department of Computer Science, University of Manitoba, R3T 2N2 Winnipeg, Manitoba, Canada;(2) Department of Statistics, University of Waterloo, N2L 3G1 Waterloo, Ontario, Canada;(3) CSIRO, Melbourne, Australia |
| |
| Abstract: | In this self-contained exposition, results are developed concerning one-factorizations of complete graphs, and incidence matrices are used to turn these factorization results into embedding theorems on Steiner triple systems. The result is a constructive graphical proof that a Steiner triple system exists for any order congruent to 1 or 3 modulo 6. A pairing construction is then introduced to show that one can also obtain triple systems which are cyclically generated. |
| |
| Keywords: | Primary 05B05 05B20 |
| 本文献已被 SpringerLink 等数据库收录！ |
|
