Premium
On cliques in spanning graphs of projective Steiner triple systems
Author(s) -
Franek Frantisek
Publication year - 2000
Publication title -
journal of combinatorial designs
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.618
H-Index - 34
eISSN - 1520-6610
pISSN - 1063-8539
DOI - 10.1002/(sici)1520-6610(2000)8:3<157::aid-jcd1>3.0.co;2-s
Subject(s) - computer science , combinatorics , citation , software , steiner tree problem , mathematics , discrete mathematics , artificial intelligence , library science , programming language
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