✦ LIBER ✦

On sparse countably infinite Steiner triple systems

✍ Scribed by K. M. Chicot; M. J. Grannell; T. S. Griggs; B. S. Webb

Publisher: John Wiley and Sons
Year: 2009
Tongue: English
Weight: 107 KB
Volume: 18
Category: Article
ISSN: 1063-8539
DOI: 10.1002/jcd.20227

No coin nor oath required. For personal study only.

✦ Synopsis

Abstract

We give a general construction for Steiner triple systems on a countably infinite point set and show that it yields 2 nonisomorphic systems all of which are uniform and r‐sparse for all finite r⩾4. © 2009 Wiley Periodicals, Inc. J Combin Designs 18: 115–122, 2010

📜 SIMILAR VOLUMES

Infinite classes of anti-mitre and 5-spa

Infinite classes of anti-mitre and 5-sparse Steiner triple systems

✍ Yuichiro Fujiwara 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 135 KB 👁 1 views

## Abstract In this paper, we present three constructions for anti‐mitre Steiner triple systems and a construction for 5‐sparse ones. The first construction for anti‐mitre STSs settles two of the four unsettled admissible residue classes modulo 18 and the second construction covers such a class mod

On list coloring Steiner triple systems

✍ P. E. Haxell; M. Pei 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 105 KB

## Abstract We study the list chromatic number of Steiner triple systems. We show that for every integer __s__ there exists __n__~0~=__n__~0~(__s__) such that every Steiner triple system on __n__ points STS(__n__) with __n__≥__n__~0~ has list chromatic number greater than __s__. We also show that t

Note on large sets of infinite steiner s

Note on large sets of infinite steiner systems

✍ Peter J. Cameron 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 250 KB 👁 1 views

Large sets of Steiner systems s ( t , k , n ) exist for all finite t and k with t < k and all infinite n. The vector space analogues exist over a field F for all finite t and k with f < R provided that either v or F is infinite, and n 1 2k -t + 1. This inequality is best possible. o 1995 John Wiley

On the chromatic numbers of Steiner trip

On the chromatic numbers of Steiner triple systems

✍ Lucien Haddad 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 188 KB 👁 2 views

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 cliques in spanning graphs of project

On cliques in spanning graphs of projective Steiner triple systems

✍ Frantisek Franek 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 129 KB 👁 3 views

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 conjecture on small embeddings of part

A conjecture on small embeddings of partial Steiner triple systems

✍ Darryn Bryant 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 106 KB 👁 1 views

## Abstract A well‐known, and unresolved, conjecture states that every partial Steiner triple system of order __u__ can be embedded in a Steiner triple system of order υ for all υ ≡ 1 or 3, (mod 6), υ ≥ 2u + 1. However, some partial Steiner triple systems of order __u__ can be embedded in Steiner t