A:" ex:ยข~dod cyclic Wple syste~ is a p;:ir (S. I') where S is a finite set and \*3" is a collection of cyclic Mples from S, where eac~ trifle may hwe repeated elements, such ~hat every ordered pair of e emen/s of & not necessarily distinct, is conlai'~ed in exactly one triple ol W. The triples m W a
Graph factorization, general triple systems, and cyclic triple systems
โ Scribed by R. G. Stanton; I. P. Goulden
- Publisher
- Springer
- Year
- 1981
- Tongue
- English
- Weight
- 955 KB
- Volume
- 22
- Category
- Article
- ISSN
- 0001-9054
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
A hybrid triple system of order v, denoted HTS(v), is said to be cyclic if it admits an automorphism consisting of a single cycle of length v. A HTS(v) admitting an automorphism consisting of a fixed point and a cycle of length v -1 is said to be rotational. Necessary and sufficient conditions are g
A transitive triple, (a,b,c), is defined to be the set )} of ordered pairs. A directed triple system of order v, DTS(v), is a pair (D, p), where D is a set of v points and fi is a collection of transitive triples of pairwise distinct points of D such that any ordered pair of distinct points of D is
A cyclic triple (a, b, c) is defined to be set { (a, b) ,(b,c),(c,a)} of ordered pairs. A Mendelsohn triple system of order v, M(2,3, u), is a pair (M, fi), w h ere M is a set of u points and fi is a collection of cyclic triples of pairwise distinct points of M such that any ordered pair of distinct