maximal induced colorable subhypergraphs of all uncolorable bsts(15)s

Clicks: 78
ID: 182718
2011
Article Quality & Performance Metrics
Overall Quality
Not rated
Combines reader engagement with the AI quality analysis. This article has not been analysed, so there is no overall score — reader engagement is measured and shown alongside.
AI Quality Assessment
Not analyzed
Readership in this journal
Steady

Ranked #31 of 39 articles by views in integrative medicine research

Most read Least read

Bar heights use a square-root scale.

Mint this article as an NFT
Not yet minted

Create a permanent, verifiable on-chain record of this article on the Scimatic Network. The NFT is held in your Journament account, and you can withdraw it to your own wallet at any time.

5 SUSD one-off · no wallet required
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 subsysytem. 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)$.
Reference Key
mathews2011computermaximal Use this key to autocite in the manuscript while using SciMatic Manuscript Manager or Thesis Manager
Authors ;Jeremy Mathews
Journal integrative medicine research
Year 2011
DOI
DOI not found
URL
Keywords

Citations

No citations found. To add a citation, contact the admin at info@scimatic.org

No comments yet. Be the first to comment on this article.