✦ LIBER ✦

Intersection Numbers of Kirkman Triple Systems

✍ Scribed by Yanxun Chang; Giovanni Lo Faro

Publisher: Elsevier Science
Year: 1999
Tongue: English
Weight: 128 KB
Volume: 86
Category: Article
ISSN: 0097-3165
DOI: 10.1006/jcta.1998.2948

No coin nor oath required. For personal study only.

✦ Synopsis

Let J R (v) denote the set of all integers k such that there exists a pair of KTS(v) with precisely k triples in common. In this article we determine the set J R (v) for v#3 (mod 6) (only 10 cases are left undecided for v=15, 21, 27, 33, 39) and establish that J R (v)=I(v) for v#3 (mod 6) and v 45, where I(v)=[0, 1, ..., t v &6, t v &4, t v ] and t v = 1 6 v(v&1).

📜 SIMILAR VOLUMES

Some infinite families of large sets of

Some infinite families of large sets of Kirkman triple systems

✍ Landang Yuan; Qingde Kang 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 145 KB 👁 1 views

## Abstract A __large set__ of Kirkman triple systems of order __v__, denoted by __LKTS__(__v__), is a collection {(__X__, __B~i~__) : 1 ≤ __i__ ≤ __v__ − 2}, where every (__X__,__B~i~__) is a __KTS__(__v__) and all __B~i~__ form a partition of all triples on __X__. Many researchers have studied th

Hamilton cycles in block-intersection gr

Hamilton cycles in block-intersection graphs of triple systems

✍ Peter Horák; David A. Pike; Michael E Raines 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 336 KB 👁 3 views

Given a BIBD S = (V, B), its 1-block-intersection graph GS has as vertices the elements of B; two vertices B1, B2 ∈ B are adjacent in GS if |B1 ∩ B2| = 1. If S is a triple system of arbitrary index λ, it is shown that GS is hamiltonian.

Quasi-embeddings of Steiner triple syste

Quasi-embeddings of Steiner triple systems, or Steiner triple systems of different orders with maximum intersection

✍ Peter Dukes; Eric Mendelsohn 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 182 KB

## Abstract In this paper, we present a conjecture that is a common generalization of the Doyen–Wilson Theorem and Lindner and Rosa's intersection theorem for Steiner triple systems. Given __u__, __v__ ≡ 1,3 (mod 6), __u__ < __v__ < 2__u__ + 1, we ask for the minimum __r__ such that there exists a

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.

Steiner triple systems with disjoint or

Steiner triple systems with disjoint or intersecting subsystems

✍ Charles J. Colbourn; Monica A. Oravas; Rolf S. Rees 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 225 KB 👁 1 views

The existence of incomplete Steiner triple systems of order v having holes of orders w and u meeting in z elements is examined, with emphasis on the disjoint (z 0) and intersecting (z 1) cases. When w ! u and v 2w u À 2z, the elementary necessary conditions are shown to be suf®cient for all values o

On the Turán Number of Triple Systems

✍ Dhruv Mubayi; Vojtêch Rödl 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 176 KB

For a family of r-graphs F; the Tur! a an number exðn; FÞ is the maximum number of edges in an n vertex r-graph that does not contain any member of F: The Tur! a an density When F is an r-graph, pðFÞ=0; and r > 2; determining pðFÞ is a notoriously hard problem, even for very simple r-graphs F: For