On cliques in spanning graphs of project
✍
Frantisek Franek
📂
Article
📅
2000
🏛
John Wiley and Sons
🌐
English
⚖ 129 KB
👁 3 views
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 proje