Hostname: page-component-cd9895bd7-dzt6s Total loading time: 0 Render date: 2024-12-27T21:54:42.346Z Has data issue: false hasContentIssue false
  • English
  • Français

A SOLUTION FOR THE EMBEDDING PROBLEM FOR PARTIAL TRANSITIVE TRIPLE SYSTEMS

Published online by Cambridge University Press:  01 May 1997

C. A. RODGER
C. A. RODGER
Affiliation:
Department of Discrete and Statistical Sciences, 120 Math Annex, Auburn University, AL 36849-5307, USA
Get access

Abstract

In this paper we solve the embedding problem for partial transitive triple systems of order n and index λ, partial TTS (n, λ) s, showing that any partial TTS (n, λ) can be embedded in a TTS (v, λ) for all λ-admissible v[ges ]2n+1. This lower bound on v is the best possible. A simple proof is also given of a result of Colbourn and Harms which shows that every partial triple system of order n and index 2λ is the underlying triple system of a partial TTS (n, λ).

Type
Research Article
Information
Bulletin of the London Mathematical Society , Volume 29 , Issue 3 , May 1997 , pp. 299 - 302
Copyright
© The London Mathematical Society 1997

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)