scientific article; zbMATH DE number 3392464

From MaRDI portal
Revision as of 04:22, 7 March 2024 by Import240305080351 (talk | contribs) (Created automatically from import240305080351)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:5661892

zbMath0248.05009MaRDI QIDQ5661892

Richard M. Wilson, Ray-Chaudhuri, Dijen K.

Publication date: 1971


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.



Related Items (only showing first 100 items - show all)

Construction of Uniform Designs and Complex-Structured Uniform Designs via Partitionable t-DesignssNew results on LR-designs and OLKTSsNew results on large sets of Kirkman triple systemsAscending subgraph decompositions of tournaments of order \(6n+3\)A construction for large sets of disjoint Kirkman triple systemsModifications of the ``central-method to construct Steiner triple systemsThe intersection numbers of nearly Kirkman triple systemsOrthogonal arrays and designs for partial triallel crossesThe 3-way intersection problem for Kirkman triple systemsA greedy algorithm for the social golfer and the Oberwolfach problemOn the number of resolvable Steiner triple systems of small 3-rankExistence of frame-derived H-designsBlock colourings of star systemsThe spectrum of resolvable Bose triple systemsThe structure of 3-pyramidal groupsConstructing uniform 2-factorizations via row-sum matrices: solutions to the Hamilton-Waterloo problemGraph and hypergraph colouring via nibble methods: a surveySteiner Triple Systems with High Chromatic IndexMore results on large sets of Kirkman triple systemsA family of diameter perfect constant-weight codes from Steiner systemsNew bounds on the size of nearly perfect matchings in almost regular hypergraphsPerfectly packing graphs with bounded degeneracy and many leavesResolvability of infinite designsOn the seven non-isomorphic solutions of the fifteen schoolgirl problemA survey on the existence ofG-DesignsUnnamed ItemAlmost all Steiner triple systems are almost resolvableRyser's conjecture for \(t\)-intersecting hypergraphsColoured and Directed DesignsEgalitarian Steiner triple systems for data popularityExtremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verificationThe first families of highly symmetric Kirkman triple systems whose orders fill a congruence classOn resolvable tree-decompositions of complete graphsThe Chromatic Index of Projective Triple SystemsIntersections of Kirkman triple systemsEmbeddings of nearly Kirkman triple systemsAsymptotic Bounds for General Covering DesignsKirkman triple systems of order 21 with nontrivial automorphism groupResolvable packings \(\widetilde{\text{R}}\text{MP}(3,2;n,n-3)\) and coverings \(\widetilde{\text{R}}\text{MC}(3,2;n,n-2)\)On resolvable designs. (Reprint)A note on strong Skolem startersGregarious kite factorization of tensor product of complete graphsOn strong Skolem starters for ℤpqThe 3-way flower intersection problem for Steiner triple systemsThe Hamilton-Waterloo problem: The case of triangle-factors and one Hamilton cycleWell-Balanced Designs for Data PlacementExistence of incomplete canonical Kirkman covering designsOn the Hamilton-Waterloo problem: the case of two cycles sizes of different parityIsomorphic factorizations X: Unsolved problemsUnnamed ItemOn the covering of pairs by quadruples. IIPacking degenerate graphsAn existence theory for pairwise balanced designs. I: Composition theorems and morphismsOn resolvable designsEmbeddings of Steiner triple systemsSystems \(S(2,4,v)\) with exactly one or without any maximal subsystemDoubly resolvable canonical Kirkman packing designs and its applicationsSteiner Triple Systems without Parallel ClassesAchromatic numbers of Kneser graphsOn the Existence of Nearly Kirkman Triple Systems with SubsystemsAscending subgraph decompositions of tournaments of orders \(6n+2\) and \(6n+1\)Ramsey-nice families of graphsA construction of optimal constant composition codesKirkman's school projectsOn the existence of unparalleled even cycle systemsFrames for Kirkman triple systemsSmall group-divisible designs with block size fourFrames and the \(g^{(k)}(v)\) problemAnonymous secret sharing schemesUniformly resolvable pairwise balanced designs with blocksizes two and threeThe existence of resolvable Steiner quadruple systemsA generalization of Wallis--Fon-Der-Flaass construction of strongly regular graphsSome new Kirkman signal setsLarge sets of Kirkman triple systems of prime power sizesGeneralized packing designsConstructions for large sets of \(v-1\{0,{v\over 3}\}\)-intersecting Steiner triple systems of order \(v\)\(f\)-vectors of pure complexes and pure multicomplexes of rank threeA new result on Sylvester's problemUniformly resolvable decompositions of \(K_v\) into \(P_3\) and \(K_3\) graphsExistence of incomplete canonical Kirkman packing designsOverlarge sets of resolvable idempotent quasigroupsEquiangular tight frames with centroidal symmetryThe family of t-designs. Part IExtended (2,4)-designsOn combinatorial designs with subdesignsConstruction of group divisible designs and rectangular designs from resolvable and almost resolvable balanced incomplete block designsThe existence of restricted resolvable designs. I: (1,2)-factorizations of \(K_{2n}\)The existence of restricted resolvable designs. II: (1,2)-factorizations of \(K_{2n+1}\)The intersection numbers of KTSs with a common parallel classMore generalized packing numbersBalanced tournament designs and resolvable (v,3,2)-BIBDsConstructions of uniform designs by using resolvable packings and coverings.P\({}_ 3\)-factorization of complete multipartite graphsOn Kirkman packing designs KPD\((\{3,4\},v)\).On large sets of Kirkman triple systems and 3-wise balanced design.Existence of incomplete resolvable minimum coverings of pairs by triples.The existence spectrum for \((3,\lambda)\)-GDDs of type \(g^t u^1\)Minimum resolvable coverings of \(K_{v}\) with copies of \(K_{4}-e\)Embeddings of resolvable triple systemsPartitioning Steiner triple systems into complete arcs







This page was built for publication: