𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Trinal Decompositions of Steiner Triple Systems into Triangles

✍ Scribed by Charles C. Lindner; Mariusz Meszka; Alexander Rosa

Book ID
112120496
Publisher
John Wiley and Sons
Year
2012
Tongue
English
Weight
548 KB
Volume
21
Category
Article
ISSN
1063-8539

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Partitioning Steiner triple systems into
Partitioning Steiner triple systems into complete arcs
✍ C.J. Colbourn; K.T. Phelps; M.J. de Resmini; A. Rosa πŸ“‚ Article πŸ“… 1991 πŸ› Elsevier Science 🌐 English βš– 713 KB

Colbourn, C.J., K.T. Phelps, M.J. de Resmini and A. Rosa, Partitioning Steiner triple systems into complete arcs, Discrete Mathematics 89 (1991) 149-160. For a Steiner triple system of order v to have a complete s-arc one must have s(s + 1)/2 3 v with equality only if s = 1 or 2 mod 4. To partition

Embeddings of Steiner triple systems
Embeddings of Steiner triple systems
✍ Jean Doyen; Richard M. Wilson πŸ“‚ Article πŸ“… 1973 πŸ› Elsevier Science 🌐 English βš– 867 KB

If X is a set whose elements are called points and A is a collectioxr of subsets of X (called lines) such that: (i) any two distinct points of X are contained in exactly one line, (ii) every line contains at least two points, we say that the pair (X, A) is a linear space. A Steiner triple system i

Decompositions of complete graphs into t
Decompositions of complete graphs into triangles and Hamilton cycles
✍ Darryn Bryant; Barbara Maenhaut πŸ“‚ Article πŸ“… 2004 πŸ› John Wiley and Sons 🌐 English βš– 121 KB πŸ‘ 1 views

## Abstract For all odd integers __n__ β‰₯ 1, let __G~n~__ denote the complete graph of order __n__, and for all even integers __n__ β‰₯ 2 let __G~n~__ denote the complete graph of order __n__ with the edges of a 1‐factor removed. It is shown that for all non‐negative integers __h__ and __t__ and all p