An existence theory for pairwise balanced designs. I: Composition theorems and morphisms

DOI10.1016/0097-3165(72)90028-3zbMath0263.05014OpenAlexW2093699365MaRDI QIDQ2561219

Publication date: 1972

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0097-3165(72)90028-3

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Other designs, configurations (05B30)

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

Pentagonal geometries with block sizes 3, 4, and 5 ⋮ On the maximum double independence number of Steiner triple systems ⋮ Graph and hypergraph packing ⋮ A remark on commutative di-associative loops ⋮ Extremal Uniquely Resolvable Multisets ⋮ Decompositions of quasirandom hypergraphs into hypergraphs of bounded degree ⋮ Counting Steiner triple systems ⋮ The Existence of Designs via Iterative Absorption: Hypergraph 𝐹-designs for Arbitrary 𝐹 ⋮ Extremal problems for pairs of triangles ⋮ The cone condition and $t$-designs ⋮ Probabilistic methods ⋮ A powerful method for constructing difference families and optimal optical orthogonal codes ⋮ Unnamed Item ⋮ Probabilistic combinatorics and the recent work of Peter Keevash ⋮ New results on LR-designs and OLKTSs ⋮ On squashed designs ⋮ Constructions of Sarvate-Beam group divisible designs ⋮ Note on independent sets in steiner systems ⋮ Pairwise balanced designs with block sizes $6t+1$ ⋮ Coverings pairs by quintuples: The case v congruent to 3 (mod 4) ⋮ Group divisible designs with block size four and type $g^ub^1 (gu/2)^1$ ⋮ Some new Kirkman signal sets ⋮ Fractional clique decompositions of dense graphs and hypergraphs ⋮ Halving Steiner 2-designs ⋮ Pair covering designs with block size 5 ⋮ Relative difference sets partitioned by cosets ⋮ Unnamed Item ⋮ Weakly union-free twofold triple systems ⋮ Uniform hypergraphs containing no grids ⋮ On the Wilson monoid of a pairwise balanced design ⋮ A Short proof of the blow-up lemma for approximate decompositions ⋮ Equiangular tight frames from group divisible designs ⋮ A generalization of group divisible t $t$‐designs ⋮ Bhaskar Rao designs with block size four ⋮ New bounds on the size of nearly perfect matchings in almost regular hypergraphs ⋮ The family of t-designs. Part I ⋮ A generalization of the singular direct product with applications to skew room squares ⋮ An existence theorem for group divisible 3-designs of large order ⋮ Optimal Codes in the Enomoto-Katona Space ⋮ Doubly resolvable Steiner quadruple systems of orders $2^{2n+1}$ ⋮ Decompositions of Edge-Colored Digraphs: A New Technique in the Construction of Constant-Weight Codes and Related Families ⋮ Pairwise balanced designs with odd block sizes exceeding five ⋮ A large order asymptotic existence theorem for group divisible 3-designs with index one ⋮ Unnamed Item ⋮ Constructions of Pairwise-and Variance-Balanced Designs ⋮ On Tight Cycles in Hypergraphs ⋮ On the combinatorial problems which I would most like to see solved ⋮ Coloured and Directed Designs ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ Edge-decompositions of graphs with high minimum degree ⋮ Four pairwise balanced designs ⋮ Proof of a conjecture on partitions of a Boolean lattice ⋮ Vertex coloring acyclic digraphs and their corresponding hypergraphs ⋮ The Asymptotic Existence of Group Divisible ‐Designs of Large Order with Index One ⋮ Archimedean graph designs. II. ⋮ Candelabra systems and designs ⋮ An existence theory for pairwise balanced designs. III: Proof of the existence conjectures ⋮ A construction for infinite families of Steiner 3-designs ⋮ The asymptotic existence of group divisible designs of large order with index one ⋮ Self-orthogonal latin squares of all orders 𝑛≠2,3,6 ⋮ Tactical constructions ⋮ On the maximal number of pairwise orthogonal Steiner triple systems ⋮ Large sets of Kirkman triple systems of orders $2^{2 n + 1} + 1$ ⋮ Partitions of the 8-dimensional vector space over GF(2) ⋮ Optimal packings of bounded degree trees ⋮ On two conjectures of Stanton and Mullin ⋮ Decomposition of $K_n$ into circuits of odd length ⋮ Bounds for equidistant codes and partial projective planes ⋮ Perfect cyclic designs ⋮ Mandatory representation designs MRD(4$,k;v$) with $k\equiv 2$ mod 3 ⋮ Matroid Designs of Prime Power Index ⋮ On TD-structures ⋮ On (n, k, l, Δ)-systems ⋮ The spectrum of idempotent varieties of algebras with binary operators based on two variable identities ⋮ Recursive constructions for cyclic BIB designs and their generalizations ⋮ On the structure of regular pairwise balanced designs ⋮ Some linear spaces with lines of two lengths ⋮ The fine intersection problem for Steiner triple systems ⋮ Truncated boolean representable simplicial complexes ⋮ A New Construction of Group Divisible Designs with Nonuniform Group Type ⋮ Matchings and covers in hypergraphs ⋮ Hypergraphs in which all disjoint pairs have distinct unions ⋮ The spectra of a variety of quasigroups and related combinatorial designs ⋮ Finite bases for some PBD-closed sets ⋮ Supersaturation of even linear cycles in linear hypergraphs ⋮ The existence of BIB designs ⋮ An existence theory for pairwise balanced designs. II: Structure of PBD- closed sets and the existence conjectures ⋮ Group Divisible Covering Designs with Block Size 4: A Type of Covering Array with Row Limit ⋮ Near-symmetric divisible designs ⋮ Universal cycles for minimum coverings of pairs by triples, with application to 2-radius sequences ⋮ Generalized Balanced Tournament Packings and Optimal Equitable Symbol Weight Codes for Power Line Communications ⋮ Some combinatorial constructions for optical orthogonal codes ⋮ Constructions and uses of incomplete pairwise balanced designs ⋮ Optimal three-dimensional optical orthogonal codes of weight three ⋮ Constructions via Hamiltonian theorems ⋮ Weakly union-free maximum packings ⋮ Degree- and Orbit-Balanced Γ-Designs When Γ Has Five Vertices ⋮ The fundamental construction for 3-designs ⋮ The existence theorem for group divisible designs of large order ⋮ A construction for group divisible $t$-designs with strength $t\geqslant 2$ and index unity

Cites Work

This page was built for publication: An existence theory for pairwise balanced designs. I: Composition theorems and morphisms