Back to Search
Start Over
On the chromatic number of Steiner triple systems of order 25
- Source :
-
Discrete Mathematics . Aug2005, Vol. 299 Issue 1-3, p120-128. 9p. - Publication Year :
- 2005
-
Abstract
- Abstract: It is well known that a Steiner triple system (STS) on points, an , can be seen as a collection of 3-subsets of its point set, called triples, such that each pair of points occurs in exactly one triple as well as a decomposition of a complete graph on vertices into cycles of length 3. By combining those two views on STSs we develop a method for its weak coloring. This method enables us to show that each is 4-colorable, which in turn implies that the chromatic spectrum of is [Copyright &y& Elsevier]
Details
- Language :
- English
- ISSN :
- 0012365X
- Volume :
- 299
- Issue :
- 1-3
- Database :
- Academic Search Index
- Journal :
- Discrete Mathematics
- Publication Type :
- Academic Journal
- Accession number :
- 18285397
- Full Text :
- https://doi.org/10.1016/j.disc.2004.07.023