An existence theory for pairwise balanced designs. III: Proof of the existence conjectures

DOI10.1016/0097-3165(75)90067-9zbMath0295.05002OpenAlexW2044422580WikidataQ122901388 ScholiaQ122901388MaRDI QIDQ1212936

Publication date: 1975

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(75)90067-9

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05)

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

Counting Steiner triple systems ⋮ Concerning the spectrum of perpendicular arrays of triple systems ⋮ Packing spanning graphs from separable families ⋮ Near perfect coverings in graphs and hypergraphs ⋮ A construction for orthogonal arrays with strength \(t\geq 3\) ⋮ Difference basis systems ⋮ A powerful method for constructing difference families and optimal optical orthogonal codes ⋮ A construction for Steiner 3-designs ⋮ Probabilistic combinatorics and the recent work of Peter Keevash ⋮ Internal representations for associative memory ⋮ A reciprocity relation for t-designs ⋮ Pairwise balanced designs with block sizes \(6t+1\) ⋮ Coverings pairs by quintuples: The case v congruent to 3 (mod 4) ⋮ Threefold triple systems with nonsingular \(N_2\) ⋮ Fractional clique decompositions of dense graphs and hypergraphs ⋮ Asymptotic existence theorems for frames and group divisible designs ⋮ Halving Steiner 2-designs ⋮ Induced Decompositions of Highly Dense Graphs ⋮ Some approaches for solving the general (\(t,k\))-design existence problem and other related problems ⋮ Linear spaces with prime power block sizes ⋮ Geometric distance-regular graphs without 4-claws ⋮ Characterizing geometric designs. II. ⋮ On the Wilson monoid of a pairwise balanced design ⋮ A Short proof of the blow-up lemma for approximate decompositions ⋮ Ramsey theorem for designs ⋮ Recent results on designs with classical parameters ⋮ Resolvable perfect cyclic designs ⋮ On the existence of doubly resolvable Kirkman systems and equidistant permutation arrays ⋮ On the construction of Schroeder quasigroups ⋮ The family of t-designs. Part I ⋮ Steiner systems for two-stage disjunctive testing ⋮ Nearly orthogonal vectors and small antipodal spherical codes ⋮ Completion and deficiency problems ⋮ Unifying some known infinite families of combinatorial 3-designs ⋮ An existence theorem for group divisible 3-designs of large order ⋮ The characterization problem for designs with the parameters of \(\mathrm{AG}_d(n,q)\) ⋮ On balanced incomplete block designs with specified weak chromatic number ⋮ Latin squares with pairwise orthogonal conjugates ⋮ 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 ⋮ Constructions of Pairwise-and Variance-Balanced Designs ⋮ Possible orders for the stabilizer of a set of M. O. L. S ⋮ A bound for Wilson's general theorem ⋮ More on decompositions of edge-colored complete graphs ⋮ Ramsey numbers of path-matchings, covering designs, and 1-cores ⋮ Two conjectures of Demetrovics, Füredi, and Katona, concerning partitions ⋮ Decompositions of edge-colored complete graphs ⋮ Coloured and Directed Designs ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ Four pairwise balanced designs ⋮ Vertex coloring acyclic digraphs and their corresponding hypergraphs ⋮ Existence results for near resolvable designs ⋮ The first families of highly symmetric Kirkman triple systems whose orders fill a congruence class ⋮ Studying designs via multisets ⋮ Candelabra systems and designs ⋮ Comparing the power of cops to zombies in pursuit-evasion games ⋮ A problem of Zarankiewicz ⋮ Twofold triple systems and graph imbeddings ⋮ Refuting conjectures in extremal combinatorics via linear programming ⋮ The asymptotic existence of group divisible designs of large order with index one ⋮ A finite embedding theorem for partial Steiner 3-designs ⋮ The set of values of \(b\) for which there exist block designs with \(b\) blocks ⋮ Orthogonal latin square graphs ⋮ Block designs and graph imbeddings ⋮ Tags on subsets ⋮ \(\mathbb{Z}\)-cyclic ordered triplewhist tournaments on \(p\) elements, where \(p\equiv 5\pmod 8\) ⋮ Optimal packings of bounded degree trees ⋮ Perfect cyclic designs ⋮ Resolvable group divisible designs with large groups ⋮ Mandatory representation designs MRD(4\(,k;v\)) with \(k\equiv 2\) mod 3 ⋮ Composition theorems for difference families and regular planes ⋮ The spectrum of idempotent varieties of algebras with binary operators based on two variable identities ⋮ Finite embedding theorems for partial pairwise balanced designs ⋮ Fifty years of the journal of combinatorial theory ⋮ Recursive constructions for cyclic BIB designs and their generalizations ⋮ On the structure of regular pairwise balanced designs ⋮ Strongly regular graphs with smallest eigenvalue -m ⋮ Developments on spectral characterizations of graphs ⋮ Some linear spaces with lines of two lengths ⋮ A New Construction of Group Divisible Designs with Nonuniform Group Type ⋮ An existence theory for loopy graph decompositions ⋮ Asymptotic enumeration of non-uniform linear hypergraphs ⋮ The spectra of a variety of quasigroups and related combinatorial designs ⋮ Finite bases for some PBD-closed sets ⋮ The family of t-designs. II ⋮ On three-designs of small order ⋮ Some combinatorial constructions for optical orthogonal codes ⋮ Constructions and uses of incomplete pairwise balanced designs ⋮ Sharpness of some intersection theorems ⋮ Pairwise balanced designs whose line sizes do not divide six ⋮ Variations on seven points: An introduction to the scope and methods of coding theory and finite geometries ⋮ A new extremal property of Steiner triple-systems ⋮ Forbidding just one intersection ⋮ The fundamental construction for 3-designs ⋮ Some recent developments on BIBDs and related designs ⋮ An asymptotic existence result on compressed sensing matrices ⋮ Covering pairs by \(q^ 2+q+1\) sets ⋮ A construction for group divisible \(t\)-designs with strength \(t\geqslant 2\) and index unity ⋮ Local balance in graph decompositions ⋮ Sparse PSD approximation of the PSD cone

Cites Work

This page was built for publication: An existence theory for pairwise balanced designs. III: Proof of the existence conjectures