𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Small embeddings of partial directed triple systems and partial triple systems with even λ

✍ Scribed by Charles J Colbourn; Rose C Hamm; C.A Rodger


Publisher
Elsevier Science
Year
1984
Tongue
English
Weight
375 KB
Volume
37
Category
Article
ISSN
0097-3165

No coin nor oath required. For personal study only.


📜 SIMILAR VOLUMES


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

Embeddings of pure mendelsohn triple sys
✍ Shen Hao 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 493 KB

## Abstract It is proved in this article that the necessary and sufficient conditions for the embedding of a λ‐fold pure Mendelsohn triple system of order __v__ in λ‐__fold__ pure Mendelsohn triple of order __u__ are λ__u__(__u__ − 1) ≡ 0 (mod 3) and __u__ ⩾ 2__v__ + 1. Similar results for the embe

A proof of Lindner's conjecture on embed
✍ Darryn Bryant; Daniel Horsley 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 243 KB 👁 1 views

## Abstract Lindner's conjecture that any partial Steiner triple system of order __u__ can be embedded in a Steiner triple system of order __v__ if $v\equiv 1,3 \; ({\rm mod}\; 6)$ and $v\geq 2u+1$ is proved. © 2008 Wiley Periodicals, Inc. J Combin Designs 17: 63–89, 2009

Embedding directed and undirected partia
✍ C. C. Lindner; C. A. Rodger 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 610 KB

Recent results have found small embeddings for partial m-cycle systems of order It with A = 1. However, if A> 1 then the best knswn techniques produce embeddings that are often quadratic functions of both m and n a d linear fmctions of A. In this article we obtain embeddings for partial m-cycle syst

Star chromatic numbers of hypergraphs an
✍ L. Haddad; H. Zhou 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 635 KB

The concept of star chromatic number of a graph, introduced by Vince ( ) is a natural generalization of the chromatic number of a graph. This concept was studied from a pure combinatorial point of view by . In this paper we introduce strong and weak star chromatic numbers of uniform hypergraphs and

Quasi-embeddings of Steiner triple syste
✍ 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