Institutul de Matematică şi Informatică "Vladimir Andrunachievici"
Universitatea de Stat din MoldovaRO EN
Maximal induced colorable subhypergraphs of all uncolorable BSTS (15)s
Authors: Jeremy Mathews
– 0.13 Mb
Abstract
A Bi-Steiner Triple System (BSTS) is a Steiner Triple System with vertices colored in such a way that the vertices of each block receive precisely two colors. When we consider all BSTS (15)s as mixed hypergraphs, we find that some are colorable while others are uncolorable. The criterion for colorability for a BSTS (15) by Rosa is containing BSTS (7) as a subsystem. Of the 80 non-isomorphic BSTS (15)s, only 23 meet this criterion and are therefore colorable. The other 57 are uncolorable. The question arose of finding maximal induced colorable subhypergraphs of these 57 uncolorable BSTS (15)s. This paper gives feasible partitions of maximal induced colorable subhypergraphs of each uncolorable BSTS (15).Troy University,
Troy, AL 36082
E-mail:
Troy, AL 36082
E-mail:
Fulltext
– 0.13 Mb
Contents
- Multiset-based Tree Model for Membrane Computing
- Maximal induced colorable subhypergraphs of all uncolorable BSTS (15)s
- Complex of abstract cubes and median problem
- About one algorithm of bidimensional interpolation using splines
- Optimal Correction of Infeasible Systems in the Second Order Conic Linear Setting
- Blind Collective Signature Protocol
- Architecting software concurrency
