On cliques in spanning graphs of projective Steiner triple systems |
| |
| Authors: | Frantisek Franek |
| |
| Institution: | Department of Computing and Software, McMaster University, Hamilton, Ontario, L8S 4L7 Canada |
| |
| 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 |
| |
| Keywords: | Steiner triple systems projective space clique boolean group |
|
|
