Geometric properties are used to determine the chromatic number of AG(4, 3) and to derive some important facts on the chromatic number of PG(n, 2). It is also shown that a 4-chromatic STS(v) exists for every admissible order v โฅ 21.
On the number of partial Steiner systems
โ Scribed by A. S. Asratian; N. N. Kuzjurin
- Publisher
- John Wiley and Sons
- Year
- 2000
- Tongue
- English
- Weight
- 101 KB
- Volume
- 8
- Category
- Article
- ISSN
- 1063-8539
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
A subset S of k vertices in a k-connected graph G is a shredder, if G -S has at least three components. We show that if G has n vertices, then the number of shredders is at most n, which was conjectured by Cheriyan and Thurimella [
We describe an algorithm that was used to classify completely all Steiner systems S(2,4,25). The result is that in addition to the 16 nonisomorphic designs with nontrivial automorphism group already known, there are precisely two such nonisomorphic designs with a trivial automorphism group.
## On the Number of Discernible On the Number of Discernible Colors Colours I was surprised that, in their study of the number of dis-The authors are grateful to Cal McCamy for his timely cernible colors, Pointer and Attridge 1 missed the early response to their original article. Neither they, nor