๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Some results on quadrilaterals in Steiner triple systems

โœ Scribed by D.R. Stinson; Y.J. Wei


Publisher
Elsevier Science
Year
1992
Tongue
English
Weight
792 KB
Volume
105
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

โœฆ Synopsis


Stinson, D.R., Y.J. Wei, Some results on quadrilaterals in Steiner triple systems, Discrete Mathematics 105 (1992) 207-219.

In this paper, we study quadrilaterals in Steiner triple systems. We present two recursive constructions for Steiner triple systems having no quadrilaterals.

We also consider the maximum number of quadrilaterals a Steiner triple system of any given order can have. The upper bound is reached precisely when the Steiner triple system is the projective space PG(d, 2). Some recursive constructions for Steiner triple systems having 'many' quadrilaterals are also presented.


๐Ÿ“œ SIMILAR VOLUMES


Some new perfect Steiner triple systems
โœ M. J. Grannell; T. S. Griggs; J. P. Murphy ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 147 KB ๐Ÿ‘ 1 views

In a Steiner triple system STS(v) = (V, B), for each pair {a, b} โŠ‚ V, the cycle graph G a,b can be defined as follows. The vertices of G a,b are V \ {a, b, c} where {a, b, c} โˆˆ B. {x, y} is an edge if either {a, x, y} or {b, x, y} โˆˆ B. The Steiner triple system is said to be perfect if the cycle gra

Some packings with Steiner triple system
โœ R.H.F. Denniston ๐Ÿ“‚ Article ๐Ÿ“… 1974 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 997 KB

To pattittrm, tnto oil ttme 2 Srciner ## 1. lntroductian 1 refer to 131 for the history of the problem. which goes back to 1850; in fxt, Caylcy [ I] showed that there is no packing of arder 7. The existence of a packi!ng of order 9 was discovered by Kirkman 141, and rectiscsvcred ?~erdI t imcs; bu

On reverse Steiner triple systems
โœ Alexander Rosa ๐Ÿ“‚ Article ๐Ÿ“… 1972 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 950 KB

1 he existence of reverse Steiner triple systems It.e. Steiner triple systems with a given involutory automorphism of speck4 type) is investigated. it is srfrwrn that such a system exists far alI wders n if n z t of 3 or 9 (mod 24: except posd&ly far n = 25. A system with this grspetty exists also f

On list coloring Steiner triple systems
โœ P. E. Haxell; M. Pei ๐Ÿ“‚ Article ๐Ÿ“… 2009 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 105 KB

## Abstract We study the list chromatic number of Steiner triple systems. We show that for every integer __s__ there exists __n__~0~=__n__~0~(__s__) such that every Steiner triple system on __n__ points STS(__n__) with __n__โ‰ฅ__n__~0~ has list chromatic number greater than __s__. We also show that t

Ubiquitous configurations in Steiner tri
โœ Eric Mendelsohn; Alexander Rosa ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 347 KB ๐Ÿ‘ 1 views

A Steiner triple system S is a C-ubiquitous (where C is a configuration) if every line of S is contained in a copy of C, and is n-ubiquitous if it is C-ubiquitous for every n-line configuration C. We determine the spectrum of 4-ubiquitous Steiner triple systems as well as the spectra of C-ubiquitous

Complete Arcs in Steiner Triple Systems
โœ Charles J Colbourn; Jeffrey H Dinitz ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 394 KB