Skip to main content
Article thumbnail
Location of Repository

ON CLIQUES IN SPANNING GRAPHS OF PROJECTIVE STEINER TRIPLE SYSTEMS

By Frantisek Franek

Abstract

Abstract. We are interested in what sizes of cliques are to be found in any arbitrary spanning graph of a Steiner triple system S. 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 S, every spanning graph of S contains a clique of size k. 1

Year: 1999
OAI identifier: oai:CiteSeerX.psu:10.1.1.135.1641
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.cas.mcmaster.ca/~fr... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.