Directed triple systems
Reads0
Chats0
TLDR
In this paper, it is shown that for the graph if λ = 1, then the graph exists for all υ such that ν ≢ 2 mod 3.About:
This article is published in Journal of Combinatorial Theory, Series A.The article was published on 1973-05-01 and is currently open access. It has received 70 citations till now. The article focuses on the topics: Bound graph & Complement graph.read more
Citations
More filters
Journal ArticleDOI
On perfect codes in deletion and insertion metric
TL;DR: The packing and covering problem for the metric space J3J consisting of g-ary words of length n and provided with the deletion and insertion metric is considered and partitions of Β ζ and of the permutation set Sn into perfect codes capable of correcting single deletions are given.
Journal ArticleDOI
Cyclic Block Designs With Block Size 3
TL;DR: It is proved that the necessary conditions for the existence of cyclic block designs with block size 3 are sufficient with two exceptions.
Book ChapterDOI
An Updated Bibliography and Survey of Steiner Systems
Jean Doyen,Alexander Rosa +1 more
TL;DR: In this article, the authors present a bibliography on Steiner systems with 730 titles, including a large number of papers dealing with finite projective, affine or inversive spaces.
Journal ArticleDOI
Isomorphic factorizations X: Unsolved problems
Frank Harary,Robert W. Robinson +1 more
TL;DR: A number of new and old open problems on isomorphic factorizations are presented along with some existing related results.
Journal ArticleDOI
Existence of Perfect 3-Deletion-CorrectingCodes
TL;DR: This paper provides new constructions for perfect 2 and 3-deletion-correcting codes from combinatorial designs, and shows that a T*(2, 5, v) exists for all v.