Representing Graphs in Steiner Triple Systems
โ Scribed by Dan Archdeacon, Terry Griggs, Costas Psomas
- Book ID
- 120788818
- Publisher
- Springer Japan
- Year
- 2013
- Tongue
- English
- Weight
- 305 KB
- Volume
- 30
- Category
- Article
- ISSN
- 0911-0119
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
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
## Abstract We prove that there is a Steiner triple system ๐ฏ such that every simple cubic graph can have its edges colored by points of ๐ฏ in such a way that for each vertex the colors of the three incident edges form a triple in ๐ฏ. This result complements the result of Holroyd and ล koviera that eve
Phelps, K.T. and C.A. Rodger, Nesting partial Steiner triple systems with 2-regular leave graphs, Discrete Mathematics 112 (1993) 1655172. In this paper we consider the problem of nesting partial Steiner triple systems. Among other results, we show that if there exists a nesting of a partial Steine