An existence theory for pairwise balanced designs. II: Structure of PBD- closed sets and the existence conjectures
From MaRDI portal
Publication:2561220
DOI10.1016/0097-3165(72)90029-5zbMath0263.05015OpenAlexW2051745720WikidataQ122875741 ScholiaQ122875741MaRDI QIDQ2561220
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)90029-5
Related Items (84)
Decompositions of quasirandom hypergraphs into hypergraphs of bounded degree ⋮ Counting Steiner triple systems ⋮ The Existence of Designs via Iterative Absorption: Hypergraph 𝐹-designs for Arbitrary 𝐹 ⋮ P3BD-closed sets ⋮ 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 ⋮ Constructions of Sarvate-Beam group divisible designs ⋮ Pairwise balanced designs covered by bounded flats ⋮ On a problem of Hering concerning orthogonal covers of \({\mathbf K}_ n\) ⋮ Number Cubes with Consecutive Line Sums ⋮ Pairwise balanced designs with block sizes \(6t+1\) ⋮ Fractional clique decompositions of dense graphs and hypergraphs ⋮ Asymptotic existence theorems for frames and group divisible designs ⋮ Halving Steiner 2-designs ⋮ Spectrum of resolvable directed quadruple systems ⋮ Unnamed Item ⋮ Combinational constructions of splitting authentication codes with perfect secrecy ⋮ On the Wilson monoid of a pairwise balanced design ⋮ A Short proof of the blow-up lemma for approximate decompositions ⋮ Difference sets in pseudocyclic association schemes ⋮ New bounds on the size of nearly perfect matchings in almost regular hypergraphs ⋮ The family of t-designs. Part I ⋮ Rational decomposition of dense hypergraphs and some related eigenvalue estimates ⋮ Steiner systems for two-stage disjunctive testing ⋮ Graph and hypergraph packing ⋮ Percentages in pairwise balanced designs ⋮ 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 ⋮ PBIB-designs and association schemes arising from minimum bi-connected dominating sets of hypercubes ⋮ On Tight Cycles in Hypergraphs ⋮ More on decompositions of edge-colored complete graphs ⋮ Decompositions of edge-colored complete graphs ⋮ 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 ⋮ Vertex coloring acyclic digraphs and their corresponding hypergraphs ⋮ The first families of highly symmetric Kirkman triple systems whose orders fill a congruence class ⋮ Some combinatorial constructions for optimal mixed-level supersaturated designs ⋮ Necessary existence criteria for mandatory representation designs MRD (4, k; ν) ⋮ The Asymptotic Existence of Group Divisible ‐Designs of Large Order with Index One ⋮ Pairwise balanced designs with prescribed minimum dimension ⋮ The Asymptotic Existence of Resolvable Group Divisible Designs ⋮ Candelabra systems and designs ⋮ Comparing the power of cops to zombies in pursuit-evasion games ⋮ An existence theory for pairwise balanced designs. III: Proof of the existence conjectures ⋮ A construction for infinite families of Steiner 3-designs ⋮ Remarks on Sade's disproof of the Euler conjecture with an application to Latin squares orthogonal to their transpose ⋮ On the spectra of certain types of latin square ⋮ Large sets of Kirkman triple systems of orders \(2^{2 n + 1} + 1\) ⋮ Rainbow decompositions ⋮ Decomposition of the complete directed graph into k-circuits ⋮ Optimal packings of bounded degree trees ⋮ Perfect cyclic designs ⋮ Resolvable group divisible designs with large groups ⋮ Construction of skew room squares ⋮ Mandatory representation designs MRD(4\(,k;v\)) with \(k\equiv 2\) mod 3 ⋮ Composition theorems for difference families and regular planes ⋮ Linear spaces with small generated subspaces ⋮ The spectrum of idempotent varieties of algebras with binary operators based on two variable identities ⋮ Conjugate orthogonal quasigroups ⋮ Recursive constructions for cyclic BIB designs and their generalizations ⋮ On the structure of regular pairwise balanced designs ⋮ Truncated boolean representable simplicial complexes ⋮ A New Construction of Group Divisible Designs with Nonuniform Group Type ⋮ Ramsey-type theorems ⋮ A note on reverse Steiner triple systems ⋮ Linear CNF formulas and satisfiability ⋮ The spectra of a variety of quasigroups and related combinatorial designs ⋮ Supersaturation of even linear cycles in linear hypergraphs ⋮ An existence theory for pairwise balanced designs. I: Composition theorems and morphisms ⋮ Uniformly resolvable three-wise balanced designs with block sizes four and six ⋮ Some combinatorial constructions for optical orthogonal codes ⋮ Constructions and uses of incomplete pairwise balanced designs ⋮ Every \(H\)-decomposition of \(K_n\) has a nearly resolvable alternative ⋮ Constructions via Hamiltonian theorems ⋮ Mutually orthogonal Latin squares with large holes ⋮ A note on the structure of pairwise balanced designs ⋮ A construction for group divisible \(t\)-designs with strength \(t\geqslant 2\) and index unity ⋮ Local balance in graph decompositions ⋮ Superpure digraph designs
Cites Work
- Unnamed Item
- Unnamed Item
- Cyclotomy and difference families in elementary Abelian groups
- An existence theory for pairwise balanced designs. I: Composition theorems and morphisms
- On the Maximal Number of Pairwise Orthogonal Latin Squares of a Given Order
- The Existence and Construction of Balanced Incomplete Block Designs
- A Balanced Incomplete Block Design
This page was built for publication: An existence theory for pairwise balanced designs. II: Structure of PBD- closed sets and the existence conjectures
