Self-converse large sets of pure Mendelsohn triple systems

A Mendelsohn triple system of order v （MTS（v）） is a pair （X,B） where X is a v-set and 5g is a collection of cyclic triples on X such that every ordered pair of X belongs to exactly one triple of B. An MTS（v） （X,B） is called pure and denoted by PMTS（v） if （x, y, z） ∈ B implies （z, y, x） ∈B. A large set of MTS（v）s （LMTS（v）） is a collection of v - 2 pairwise disjoint MTS（v）s on a v-set. A self-converse large set of PMTS（v）s, denoted by LPMTS＊ （v）, is an LMTS（v） containing [ v-2/2] converse pairs of PMTS（v）s. In this paper, some results about the existence and non-existence for LPMTS＊ （v） are obtained.     

The existence spectrum for overlarge sets of pure directed triple systems

A directed triple system of order v,denoted by DTS(v),is a pair (X,B) where X is a v-set and B is a collection of transitive triples on X such that every ordered pair of X belongs to exactly one triple of B.A DTS(v) (X,A) is called pure and denoted by PDTS(v) if (a,b,c) ∈ A implies (c,b,a) ∈/ A.An overlarge set of PDTS(v),denoted by OLPDTS(v),is a collection {(Y \{yi},Aij) : yi ∈ Y,j ∈ Z3},where Y is a (v+1)-set,each (Y \{yi},Aij) is a PDTS(v) and these Ais form a partition of all transitive triples on Y .In this paper,we shall discuss the existence problem of OLPDTS(v) and give the following conclusion: there exists an OLPDTS(v) if and only if v ≡ 0,1 (mod 3) and v 3.     

The spectrum for overlarge sets of directed triple systems

A directed triple system of order v,denoted by DTS(v,λ),is a pair(X,B)where X is a v- set and B is a collection of transitive triples on X such that every ordered pair of X belongs toλtriples of B.An overlarge set of disjoint DTS(v,λ),denoted by OLDTS(v,λ),is a collection{(Y\{y},A_i)}_i, such that Y is a(v 1)-set,each(Y\{y},A_i)is a DTS(v,λ)and all A_i's form a partition of all transitive triples of Y.In this paper,we shall discuss the existence problem of OLDTS(v,λ)and give the following conclusion:there exists an OLDTS(v,λ)if and only if eitherλ=1 and v≡0,1(mod 3),orλ=3 and v≠2.     

The spectrum for overlarge sets of hybrid triple systems

A hybrid triple system of order v and index λ,denoted by HTS(v,λ),is a pair(X,B) where X is a v-set and B is a collection of cyclic triples and transitive triples on X,such that every ordered pair of X belongs to λ triples of B. An overlarge set of disjoint HTS(v,λ),denoted by OLHTS(v,λ),is a collection {(Y \{y},Ai)}i,such that Y is a(v+1)-set,each(Y \{y},Ai) is an HTS(v,λ) and all Ais form a partition of all cyclic triples and transitive triples on Y.In this paper,we shall discuss the existence problem of OLHTS(v,λ) and give the following conclusion: there exists an OLHTS(v,λ) if and only if λ=1,2,4,v ≡ 0,1(mod 3) and v≥4.     

Embeddings of Pure Mendelsohn Triple Systems and Pure Directed Triple Systems

A λ-fold triple system of order v,denoted TS(v,λ),is a pair(V,A)where V is a v-set and A is a collection of 3-subsets(called triples)of V such that each 2-subset of V is contained in exactly λ triples.A triple system is called simple if itcontains no repeated triples. There are two related classes of triple systems,namely,Mendelsohn triple sys-tems and directed triple systems.     

有向Kirkman填充设计的谱

§ 1　IntroductionLet X be a set of v points.A packing(directed packing) of X is a collection of subsets(ordered subsets) of X(called blocks) such that any pair(ordered pair) of distinct pointsfrom X occur together in atmostone block in the collection.A packing(directed packing)is called resolvable ifitsblock setadmitsa partition into parallel classes,each parallel classbeing a partition of the pointset X.A Kirkman triple system KTS(v) is a collection Tof3 -subsets of X(triples) suchthat …     

On Indecomposable Triple Systems Without Repeated Blocks

A λ-fold triple system TS(ν,λ)is an ordered pair(V,B)where V is a setof v elements and B is a collection of 3-subsets(called blocks or triples)of Vsuch that each 2-subset of V is contained in exactly λ triples.A triple system iscalled simple if it contains no repeated triples.     

Embeddings of Kirkman Systems KS(2,4,v)

A balanced incomplete block design(BIBD)B(κ,λ;ν)is a pair(X,A),whereX is a v-set of elements(called points)and A is a collection of k-subsets of X(called blocks)such that every unordered pair of points of X appears in exactlyλ blocks of A.A B(κ,1;ν)is called a Steiner system and denoted by S(2,κ,ν). A parallel class in a BIBD is a set of blocks that forms a partition of the     

The Existence of （v, 4, 1） Disjoint Difference Families with v a Prime Power

A （v, k, λ） difference family （（v, k, λ）-DF in short） over an abelian group G of order v, is a collection F=（Bi｜i ∈ I} of k-subsets of G, called base blocks, such that any nonzero element of G can be represented in precisely A ways as a difference of two elements lying in some base blocks in F. A （v, k, λ）-DDF is a difference family with disjoint blocks. In this paper, by using Weil＇s theorem on character sum estimates, it is proved that there exists a （p^n, 4, 1）-DDF, where p = 1 （rood 12） is a prime number and n ≥1.     

Existence of a-fold Perfect （v, {5, 8}, 1）-Mendelsohn Designs

Let v be a positive integer and let K be a set of positive integers. A （v, K, 1）-Mendelsohn design, which we denote briefly by （v, K, 1）-MD, is a pair （X, B） where X is a v-set （of points） and B is a collection of cyclically ordered subsets of X （called blocks） with sizes in the set K such that every ordered pair of points of X are consecutive in exactly one block of B. If for all t =1, 2,..., r, every ordered pair of points of X are t-apart in exactly one block of B, then the （v, K, 1）-MD is called an r-fold perfect design and denoted briefly by an r-fold perfect （v, K, 1）-MD. If K = {k） and r = k - 1, then an r-fold perfect （v, （k）, 1）-MD is essentially the more familiar （v, k, 1）-perfect Mendelsohn design, which is briefly denoted by （v, k, 1）-PMD. In this paper, we investigate the existence of 4-fold perfect （v, （5, 8}, 1）-Mendelsohn designs.     

The spectrum for large sets of pure directed triple systems

An LPDTS(ν) is a collection of 3(ν-2) disjoint pure directed triple systems on the same set ofνelements. It is showed in Tian's doctoral thesis that there exists an LPDTS(ν) forν=0,4 (mod 6),ν≥4. In this paper, we establish the existence of an LPDTS(ν) forν= 1,3 (mod 6),ν> 3. Thus the spectrum for LPDTS(ν) is completely determined to be the set {ν:ν= 0, 1 (mod 3),ν≥4}.     

Indecomposable large sets of Steiner triple systems with indices 5, 6

A family ( X, B1 ), (X, B2 ), . . . , (X, Bq ) of q STS(v)s is a λ-fold large set of STS(v) and denoted by LSTS λ (v) if every 3-subset of X is contained in exactly λ STS(v)s of the collection. It is indecomposable and denoted by IDLSTS λ (v) if there does not exist an LSTS λ'(v) contained in the collection for any λ' λ. In this paper, we show that for λ = 5, 6, there is an IDLSTS λ (v) for v ≡ 1 or 3 (mod 6) with the exception IDLSTS6 (7).     

λ-fold indecomposable large sets of Steiner triple systems

A family (X, B1), (X, B2), . . . , (X, Bq) of q STS(v)s is a λ-fold large set of STS(v) and denoted by LSTSλ(v) if every 3-subset of X is contained in exactly λ STS(v)s of the collection. It is indecomposable and denoted by IDLSTSλ(v) if there exists no LSTSλ (v) contained in the collection for any λ λ. In 1995, Griggs and Rosa posed a problem: For which values of λ 1 and orders v ≡ 1, 3 (mod 6) do there exist IDLSTSλ(v)? In this paper, we use partitionable candelabra systems (PCSs) and holey λ-fold large set of STS(v) (HLSTSλ(v)) as auxiliary designs to establish a recursive construction for IDLSTSλ(v) and show that there exists an IDLSTSλ(v) for λ = 2, 3, 4 and v ≡ 1, 3 (mod 6).     

$K_v$的最大$K_2K_3$填充设计

Abstract Let Kv be the complete graph on v vertices, and G a finite simple undirected graph without isolated vertices. A G-packing of Kv, denoted by （v, G, 1）-packing, is a pair （X,A） where X is the vertex set of K＋ and ＋4 is a family of edge-disjoint subgraphs isomorphic to G in Kv. In this paper, the maximum number of subgraphs in a （v, G, 1）-packing is determined when G is K2 x K3, the Cartesian product of K2 and K3, leaving two orders undetermined. This design originated from the use of DNA library screening.     

可分解的Hybrid三元系大集和超大集的构造

An LRHTS(v)(or LARHTS(v)) is a collection of {(X, B i) : 1 ≤ i ≤ 4(v-2)},where X is a v-set, each(X, B i) is a resolvable(or almost resolvable) HTS(v), and all B i s form a partition of all cycle triples and transitive triples on X. An OLRHTS(v)(or OLARHTS(v))is a collection {(Y \{y}, A j y) : y ∈ Y, j = 0, 1, 2, 3}, where Y is a(v + 1)-set, each(Y \{y}, A j y)is a resolvable(or almost resolvable) HTS(v), and all A j y s form a partition of all cycle and transitive triples on Y. In this paper, we establish some directed and recursive constructions for LRHTS(v), LARHTS(v), OLRHTS(v), OLARHTS(v) and give some new results.     

Outpaths of arcs in multipartite tournaments

1. IntroductionThroughout the paPer, we use the terminology and notation of [1] and [2]. Let D =(V(D), A(D)) be a digraPh. If xy is an arc of a digraPh D, then we say that x dominatesy, denoted by x - y. More generally, if A and B are two disjoint vertex sets of D such thatevery vertex of A dominates every vertex of B, then we say that A dominates B, denotedby A - B. The outset N (x) of a vertex x is the set of vertices dominated by x in D,and the inset N--(x) is the set of vertices d…     

2-(v,k,1)设计和PSL(3,q)(q是奇数)

§ 1　 IntroductionA2 -(v,k,1 ) design D=(S,B) consists ofa finite set Sof v points and a collection Bof some subsets of S,called blocks,such that any two points lie on exactly one blockand each block contains exactly k points.A flag of Dis a pair(α,B) such thatα∈S,B∈Bandα∈B,the set of all flags is denoted by F.We assume that2≤k≤v.An automorphism of Dis a permutation of the points which leaves the set Binvari-ant,all the automorphisms form a group Aut D.Let G be a subgroup of A…     

On the restricted arc-connectivity of s-geodetic digraphs

For a strongly connected digraph D the minimum ,cardinality of an arc-cut over all arc-cuts restricted arc-connectivity λ′（D） is defined as the S satisfying that D - S has a non-trivial strong component D1 such that D - V（D1） contains an arc. Let S be a subset of vertices of D. We denote by w＋（S） the set of arcs uv with u ∈ S and v S, and by w-（S） the set of arcs uv with u S and v ∈ S. A digraph D = （V, A） is said to be λ′-optimal if λ′（D） =ξ′（D）, where ξ′（D） is the minimum arc-degree of D defined as ξ（D） = min {ξ′（xy） ： xy ∈ A}, and ξ′（xy） = min（｜ω＋（{x,y}）｜, ｜w-（{x,y}）｜, ｜w＋（x） ∪ w- （y） ｜, ｜w- （x） ∪ω＋ （y）｜}. In this paper a sufficient condition for a s-geodetic strongly connected digraph D to be λ′-optimal is given in terms of its diameter. Furthermore we see that the h-iterated line digraph Lh（D） of a s-geodetic digraph is λ′-optimal for certain iteration h.     

完全可分的三元系TS(v,4)的支撑集

§ 1　 IntroductionA triple system of order v and indexλ,denoted by TS(v,λ) ,is a collection of3- ele-mentsubsets Aof a v- set X,so thatevery 2 - subsetof X appears in preciselyλ subsets of A.L etλ≥ 2 and (X,A) be a TS(v,λ) .If Acan be partitioned into t(≥ 2 ) parts A1,A2 ,...,Atsuch that each (X,Ai) is a TS(v,λi) for 1≤ i≤ t,then (X,A) is called de-composable.Otherwise it is indecomposable.If t=λ,λi=1for 1≤ i≤ t,the TS(v,λ) (X,A) is called completely decomposable.It …     

$\alpha$-可分解4-圈系统

An m-cycle system of order v and index λ, denoted by m-CS（v,λ）, is a collection of cycles of length m whose edges partition the edges of λKv. An m-CS（v,λ） is α-resolvable if its cycles can be partitioned into classes such that each point of the design occurs in precisely α cycles in each class. The necessary conditions for the existence of such a design are m｜λv（v-1）/2,2｜λ（v -1）,m｜αv,α｜λ（v-1）/2. It is shown in this paper that these conditions are also sufficient when m = 4.