✦ LIBER ✦

On cliques in spanning graphs of projective Steiner triple systems

✍ Scribed by Frantisek Franek

Publisher: John Wiley and Sons
Year: 2000
Tongue: English
Weight: 129 KB
Volume: 8
Category: Article
ISSN: 1063-8539
DOI: 10.1002/(sici)1520-6610(2000)8:3<157::aid-jcd1>3.0.co;2-s

No coin nor oath required. For personal study only.

✦ Synopsis

We are interested in the sizes of cliques that are to be found in any arbitrary spanning graph of a Steiner triple system S S. In this paper we investigate spanning graphs of projective Steiner triple systems, proving, not surprisingly, that for any positive integer k and any suf®ciently large projective Steiner triple system S S, every spanning graph of S S contains a clique of size k.