Journal article
On cliques in spanning graphs of projective Steiner triple systems
Abstract
We are interested in the sizes of cliques that are to be found in any arbitrary spanning graph of a Steiner triple system 𝒮. In this paper we investigate spanning graphs of projective Steiner triple systems, proving, not surprisingly, that for any positive integer k and any sufficiently large projective Steiner triple system 𝒮, every spanning graph of 𝒮 contains a clique of size k. © 2000 John Wiley & Sons, Inc. J Combin Designs 8: 157–165, 2000
Authors
Franek F
Journal
Journal of Combinatorial Designs, Vol. 8, No. 3, pp. 157–165
Publisher
Wiley
Publication Date
2000
DOI
10.1002/(sici)1520-6610(2000)8:3<157::aid-jcd1>3.0.co;2-s
ISSN
1063-8539