Search

We construct a Ramsey class whose objects are Steiner systems. In contrast to the situation with general r -uniform hypergraphs, it turns out that simply putting linear orders on their sets of vertices is not enough for this purpose: one also has to strengthen the notion of subobjects used from “induced subsystems” to something we call “strongly induced subsystems”. Moreover we study the Ramsey properties of other classes of Steiner systems obtained from this class by either forgetting the order or by working with the usual notion of subsystems. This leads to a perhaps surprising induced Ramsey theorem in which designs get coloured. [ABSTRACT FROM AUTHOR]

Equiangular tight frames provide optimal packings of lines through the origin. We combine Steiner triple systems with Hadamard matrices to produce a new infinite family of equiangular tight frames. This in turn leads to new constructions of strongly regular graphs and distance-regular antipodal covers of the complete graph. [ABSTRACT FROM AUTHOR]

The family Σ r consists of all r -graphs with three edges D 1 , D 2 , D 3 such that | D 1 ∩ D 2 | = r − 1 and D 1 △ D 2 ⊆ D 3 . A generalized triangle , T r ∈ Σ r is an r -graph on { 1 , 2 , … , 2 r − 1 } with three edges D 1 , D 2 , D 3 , such that D 1 = { 1 , 2 , … , r − 1 , r } , D 2 = { 1 , 2 , … , r − 1 , r + 1 } and D 3 = { r , r + 1 , … , 2 r − 1 } . Frankl and Füredi conjectured that for all r ≥ 4 , ex ( n , Σ r ) = ex ( n , T r ) for all sufficiently large n and they also proved it for r = 3 . Later, Pikhurko showed that the conjecture holds for r = 4 . In this paper we determine ex ( n , T 5 ) and ex ( n , T 6 ) for sufficiently large n , proving the conjecture for r = 5 , 6 . [ABSTRACT FROM AUTHOR]

Abstract: For each positive integer n, we construct a Steiner triple system of order with no almost parallel class; that is, with no set of disjoint triples. In fact, we construct families of -designs with an analogous property. The only previously known examples of Steiner triple systems of order congruent to without almost parallel classes were the projective triple systems of order with n odd, and 2 of the 11,084,874,829 Steiner triple systems of order 19. [Copyright &y& Elsevier]

Abstract: The block graph of a Steiner triple system of order v is a strongly regular graph. For large v, every strongly regular graph with these parameters is the block graph of a Steiner triple system, but exceptions exist for small orders. An explanation for some of the exceptional graphs is here provided via the concept of switching. (Group divisible designs corresponding to) Latin squares are also treated in an analogous way. Many new strongly regular graphs are obtained by switching and by constructing graphs with prescribed automorphisms. In particular, new strongly regular graphs with the following parameters that do not come from Steiner triple systems or Latin squares are found: , , , , , and . [Copyright &y& Elsevier]

Abstract: It has been conjectured that any partial triple system of order u and index λ can be embedded in a triple system of order v and index λ whenever , is even and . This conjecture is known to hold for and for all even . Here the conjecture is proven for all remaining values of λ when . [Copyright &y& Elsevier]

Abstract: We give a construction of a 2- design starting from a Steiner system and an affine plane of order n. This construction is applied to known classes of Steiner systems arising from affine and projective geometries, Denniston designs, and unitals. We also consider the extendability of these designs to 3-designs. [ABSTRACT FROM AUTHOR]

Abstract: This paper takes a significant step towards confirming a long-standing and far-reaching conjecture of Peter J. Cameron and Cheryl E. Praeger. They conjectured in 1993 that there are no non-trivial block-transitive 6-designs. We prove that the Cameron–Praeger conjecture is true for the important case of non-trivial Steiner 6-designs, i.e. for 6- designs with , except possibly when the group is with or 3, and e is an odd prime power. [Copyright &y& Elsevier]

Abstract: We give the first known examples of 6-sparse Steiner triple systems by constructing 29 such systems in the residue class 7 modulo 12, with orders ranging from 139 to 4447. We then present a recursive construction which establishes the existence of 6-sparse systems for an infinite set of orders. Observations are also made concerning existing construction methods for perfect Steiner triple systems, and we give a further example of such a system. This has order 135,859 and is only the fourteenth known. Finally, we present a uniform Steiner triple system of order 180,907. [Copyright &y& Elsevier]

Abstract: The Steiner quadruple systems of order 16 are classified up to isomorphism by means of an exhaustive computer search. The number of isomorphism classes of such designs is . Properties of the designs—including the orders of the automorphism groups and the structures of the derived Steiner triple systems of order 15—are tabulated. A consistency check based on double counting is carried out to gain confidence in the correctness of the classification. [Copyright &y& Elsevier]

Abstract: In [Z. Füredi, Turán type problems, in: Surveys in Combinatorics, Guildford, 1991, in: London Math. Soc. Lecture Note Ser., vol. 166, Cambridge Univ. Press, Cambridge, 1991, pp. 253–300, MR1161467 (93d:05072)], Füredi raised a conjecture about the maximum size of L-intersecting families. In this note, we address a variant of this conjecture. In particular, we show that for any Steiner triple system on , there exist a family of k-sets on with and such that for every the family is isomorphic to . [Copyright &y& Elsevier]

Abstract: A Steiner triple system of order (briefly STS) consists of a -element set X and a collection of 3-element subsets of X, called blocks, such that every pair of distinct points in X is contained in a unique block. A large set of disjoint STS (briefly LSTS) is a partition of all 3-subsets (triples) of X into STS. In 1983–1984, Lu Jiaxi first proved that there exists an LSTS for any or with six possible exceptions and a definite exception . In 1989, Teirlinck solved the existence of LSTS for the remaining six orders. Since their proof is very complicated, it is much desired to find a simple proof. For this purpose, we give a new proof which is mainly based on the 3-wise balanced designs and partitionable candelabra systems. [Copyright &y& Elsevier]

Any partial Steiner triple system of order u can be embedded in a Steiner triple system of order v if v≡1,3 (mod 6) and v⩾3u−2. [Copyright &y& Elsevier]

Orthogonal quadruple systems are defined and investigated. Orthogonal quadruple systems with an additional nesting property are shown to provide a new construction of 3-frames F(3,4,n{2}) (Design Codes Cryptogr. 4 (1994) 5). Constructions for pairs of nested orthogonal quadruple systems are provided. Applications to 2-resolvable Steiner quadruple systems and highly nonlinear functions are discussed. [Copyright &y& Elsevier]

A Steiner triple system (STS(v)) is said to be 3-balanced if every 3-colouring of it is equitable; that is, if the cardinalities of the colour classes differ by at most one. A 3-colouring, φ, of an STS(v) is unique if there is no other way of 3-colouring the STS(v) except possibly by permuting the colours of φ. We show that for every admissible v⩾25, there exists a 3-balanced STS(v) with a unique 3-colouring and an STS(v) which has a unique, non-equitable 3-colouring. [Copyright &y& Elsevier]

Two Steiner triple systems (STS) are orthogonal if their sets of triples are disjoint, and two disjoint pairs of points defining intersecting triples in one system fail to do so in the other. In 1994, it was shown (Canad. J. Math. 46(2) (1994) 239–252) that there exist a pair of orthogonal Steiner triple systems of order v for all v≡1,3 (mod 6), with v⩾7, v≠9. In this paper we show that there exist three pairwise orthogonal Steiner triple systems of order v for all v≡1 (mod 6), with v⩾19 and for all v≡3 (mod 6), with v⩾27 with only 24 possible exceptions. [Copyright &y& Elsevier]

The Erdo˝s–Stone–Simonovits Theorem implies that the Tura´n density of a family of graphs is the minimum of the Tura´n densities of the individual graphs from the family. It was conjectured by Mubayi and Ro¨dl (J. Combin. Theory Ser. A, submitted) that this is not necessarily true for hypergraphs, in particular for triple systems. We give an example, which shows that their conjecture is true. [Copyright &y& Elsevier]

For a family of r-graphs F the Tura´n 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 Tura´n density π(F)=limlower limit n→∞ ex(n,F)/((nr). When F is an r-graph, π(F)≠0, and r>2, determining π(F) is a notoriously hard problem, even for very simple r-graphs F. For example, when r=3, the value of π(F) is known for very few (<10) irreducible r-graphs. Building upon a method developed recently by de Caen and Fu¨redi (J. Combin. Theory Ser. B78 (2000), 274–276), we determine the Tura´n densities of several 3-graphs that were not previously known. Using this method, we also give a new proof of a result of Frankl and Fu¨redi (Combinatorica 3 (1983), 341–349) that π(H)=2/9, where H has edges 123,124,345. Let F(3,2) be the 3-graph 123,145,245,345, let K−4 be the 3-graph 123,124,234, and let C5 be the 3-graph 123,234,345,451,512. We prove

Perfect codes and optimal anticodes in the Grassman graph Gq(n, k) are examined. It is shown that the vertices of the Grassman graph cannot be partitioned into optimal anticodes, with a possible exception when n=2k. We further examine properties of diameter perfect codes in the graph. These codes are known to be similar to Steiner systems. We discuss the connection between these systems and “real” Steiner systems. [Copyright &y& Elsevier]

Kramer and Magliveras constructed simple 5-(24,8,λ) designs for λ&les;9. Betten et al. constructed simple 5-(24,8,λ) designs for λ=16,17,…,484. In this paper, we construct 15 mutually disjoint Steiner systems S(5,8,24) and thus we construct simple 5-(24,8,λ) design for λ=10,11,12,13,14 and 15. As a consequence there exists a simple 5-(24,8,λ) design for any positive integer λ&les;λmax=969. [Copyright &y& Elsevier]