Powered by OpenAIRE graph
Found an issue? Give us feedback
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/ Journal of Combinato...arrow_drop_down
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/
Journal of Combinatorial Theory Series A
Article
License: Elsevier Non-Commercial
Data sources: UnpayWall
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/
Journal of Combinatorial Theory Series A
Article . 2007
License: Elsevier Non-Commercial
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/
image/svg+xml Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Closed Access logo, derived from PLoS Open Access logo. This version with transparent background. http://commons.wikimedia.org/wiki/File:Closed_Access_logo_transparent.svg Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao
Journal of Combinatorial Theory Series A
Article . 2007 . Peer-reviewed
License: Elsevier Non-Commercial
Data sources: Crossref
image/svg+xml Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Closed Access logo, derived from PLoS Open Access logo. This version with transparent background. http://commons.wikimedia.org/wiki/File:Closed_Access_logo_transparent.svg Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao
zbMATH Open
Article . 2007
Data sources: zbMATH Open
DBLP
Article . 2007
Data sources: DBLP
versions View all 5 versions
addClaim

On 6-sparse Steiner triple systems

Authors: A. D. Forbes; Mike J. Grannell; Terry S. Griggs;

On 6-sparse Steiner triple systems

Abstract

A Steiner triple system of order \(v\) \([\text{STS}(v)]\) consists of a \(v\)-set \(V\) of elements and a family \(B\) of 3-subsets of \(V\) called triples such that each 2-subset of \(V\) is contained in exactly one triple of \(B\). A configuration in an \(\text{STS}(v)\) is a partial triple system consisting typically of a small number of triples. An \(\text{STS}(v)\) is \(k\)-sparse if it contains no configuration with \(n\) triples and \(n+2\) points for any \(4\leq n\leq k\). The 4-sparse STSs are precisely those which are anti-Pasch, and are known to exist for all orders \(v\) congruent to 1 or 3 modulo 6, except for \(v= 7\) or 13. The 5-sparse STSs are precisely those which are both anti-Pasch and anti-mitre, and have been shown by \textit{A. Wolfe} [Electron. J. Comb. 12, No. 1, Research paper R68, 42 p., electronic only (2005; Zbl 1079.05013)] to exist for almost all admissible orders. In this article, the authors use a construction of \textit{M. J. Grannell}, \textit{T. S. Griggs} and \textit{J. P. Murphy} [J. Comb. Des. 7, No. 5, 327--330 (1999; Zbl 0935.05016)] to obtain first examples of 6-sparse STSs. Their 29 examples given range from \(v= 139\) to \(v= 4447\); it is shown that these are the only 6-sparse STSs that can be obtained by using this method. A tripling construction and a product construction are then used to show that there exist infinitely many 6-sparse STSs. Also in this paper, the authors construct a new perfect STS of order \(v= 135\),859 and a new uniform (non-perfect) STS with \(v= 180\),907.

Related Organizations
Keywords

k-Sparse Steiner triple system, Steiner triple system, Crown configuration, Computational Theory and Mathematics, Triple systems, Mitre configuration, Pasch configuration, Perfect Steiner triple system, Discrete Mathematics and Combinatorics, Theoretical Computer Science

  • BIP!
    Impact byBIP!
    selected citations
    These citations are derived from selected sources.
    This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    24
    popularity
    This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
    Average
    influence
    This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    Top 10%
    impulse
    This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
    Top 10%
Powered by OpenAIRE graph
Found an issue? Give us feedback
selected citations
These citations are derived from selected sources.
This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Citations provided by BIP!
popularity
This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
BIP!Popularity provided by BIP!
influence
This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Influence provided by BIP!
impulse
This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
BIP!Impulse provided by BIP!
24
Average
Top 10%
Top 10%
hybrid