2-designs having an intersection number \(k-n\)

DOI10.1016/0097-3165(80)90059-XzbMath0425.05009MaRDI QIDQ1135286

Henry Beker, Willem H. Haemers

Publication date: 1980

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

zbMATH Keywords

BIBDintersection numberbalanced incomplete block designs

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05)

Related Items (16)

A survey of some problems in combinatorial designs - a matrix approach ⋮ Interlacing eigenvalues and graphs ⋮ New results for quasi-symmetric designs\(-\) an application of MACSYMA ⋮ Three-class association schemes from partial geometric designs ⋮ Distances, graphs and designs ⋮ Some remarks on subdesigns of symmetric designs ⋮ Applications of algebraic duality to group divisible structures ⋮ The absolute bound for coherent configurations ⋮ On extremal intersection numbers of a block design ⋮ On designs related to coherent configurations of type \((^ 2\;^ 2_ 4)\) ⋮ A construction method for point divisible designs ⋮ New proofs of the Assmus-Mattson theorem based on the Terwilliger algebra ⋮ On the parameters of strongly resolvable designs ⋮ The family of t-designs. II ⋮ Three-class association schemes ⋮ Tactical decompositions of designs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An infinite family of symmetric designs
• Some designs which admit strong tactical decompositions
• On resolutions and Bose's theorem
• A construction method for point divisible designs
• Embedding of quasi-residual designs
• Strongly regular graphs with (-1, 1, 0) adjacency matrix having eigenvalue 3
• On Strong Tactical Decompositions
• Strongly Regular Graphs Derived from Combinatorial Designs
• SYMMETRIC HADAMARD MATRICES OF ORDER 36
• On some Theorems in Combinatorics Relating to Incomplete Block Designs

This page was built for publication: 2-designs having an intersection number \(k-n\)