𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the maximal number of pairwise orthogonal Steiner triple systems

✍ Scribed by K.B Gross

Publisher
Elsevier Science
Year
1975
Tongue
English
Weight
373 KB
Volume
19
Category
Article
ISSN
0097-3165

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On the chromatic numbers of Steiner trip
On the chromatic numbers of Steiner triple systems
✍ Lucien Haddad πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 188 KB πŸ‘ 2 views

Geometric properties are used to determine the chromatic number of AG(4, 3) and to derive some important facts on the chromatic number of PG(n, 2). It is also shown that a 4-chromatic STS(v) exists for every admissible order v β‰₯ 21.

On the maximum number of disjoint Steine
On the maximum number of disjoint Steiner triple systems
✍ Luc Teirlinck πŸ“‚ Article πŸ“… 1973 πŸ› Elsevier Science 🌐 English βš– 184 KB

Let D(u) be the maximum number of pairwk disjoint Steiner triple sysiems of order v. We prove that D(3v:r 2 2v + D(v) for every u = 1 oi 3 (mod 6), u 2 3. As a corollary, we have D(3n) -3n-2 for every n 2 1.

On the number of partial Steiner systems
On the number of partial Steiner systems
✍ A. S. Asratian; N. N. Kuzjurin πŸ“‚ Article πŸ“… 2000 πŸ› John Wiley and Sons 🌐 English βš– 101 KB πŸ‘ 2 views
On the TurΓ‘n Number of Triple Systems
On the TurΓ‘n Number of Triple Systems
✍ Dhruv Mubayi; VojtΓͺch RΓΆdl πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 176 KB

For a family of r-graphs F; the Tur! a an number exðn; FÞ is the maximum number of edges in an n vertex r-graph that does not contain any member of F: The Tur! a an density When F is an r-graph, pðFÞ=0; and r > 2; determining pðFÞ is a notoriously hard problem, even for very simple r-graphs F: For