A survey of some problems in combinatorial designs - a matrix approach

DOI10.1016/0024-3795(86)90301-0zbMath0594.05008OpenAlexW1975806614MaRDI QIDQ1076673

Mohan S. Shrikhande

Publication date: 1986

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0024-3795(86)90301-0

zbMATH Keywords

surveycombinatorial designsmatrix theoretic methods

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Combinatorial aspects of block designs (05B05)

Related Items

Finiteness questions in quasi-symmetric designs ⋮ The structure of triangle-free quasi-symmetric designs ⋮ On designs with intersection numbers 0 and 2 ⋮ Strongly regular graphs with strongly regular decomposition ⋮ New results for quasi-symmetric designs\(-\) an application of MACSYMA ⋮ Quasi-symmetric 2,3,4-designs ⋮ Unnamed Item ⋮ Schematic 4-designs ⋮ Some results on the Ryser design conjecture ⋮ Some results on the Ryser design conjecture. III

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Tactical decompositions of designs
• Quasi-residual 2-designs, 1,5-designs, and strongly regular multigraphs
• Finiteness questions in quasi-symmetric designs
• The structure of triangle-free quasi-symmetric designs
• Strongly divisible 1-designs
• 2-designs having an intersection number \(k-n\)
• \(t{1\over 2}\)-designs
• On a class of partially balanced incomplete block designs
• Some remarks on subdesigns of symmetric designs
• The family of t-designs. Part I
• Quasi-residual quasi-symmetric designs
• S-quasi-symmetry
• Designs with no three mutually disjoint blocks
• On extremal intersection numbers of a block design
• Incidence matrices of t-designs
• Affine resolvable balanced incomplete block designs: a survey
• Strongly regular graphs and group divisible designs
• A characterization of partial geometric designs
• On t-designs
• On resolutions and Bose's theorem
• On the uniqueness of the tetrahedral association schemes
• Special partially balanced incomplete block designs and associated graphs
• Algebraic duality theorems with combinatorial applications
• Parallel concepts in graph theory
• Characterization of the graphs of the Johnson schemes G(3k,k) and G(3k+1,k)
• Inequalities for t designs
• The family of t-designs. II
• Strongly regular graphs with (-1, 1, 0) adjacency matrix having eigenvalue 3
• Geometric and pseudo-geometric graphs \((q^ 2 + 1,q + 1,1)\)
• Strongly regular graphs, partial geometries and partially balanced designs
• On the Uniqueness of the Triangular Association Scheme
• On the Exceptional Case in a Characterization of the Arcs of a Complete Graph
• On the Polynomial of a Graph
• An Inequality for Generalized Quadrangles
• On Strong Tactical Decompositions
• On the Line Graph of a Symmetric Balanced Incomplete Block Design
• Quasi-symmetric balanced incomplete block designs
• Strongly Regular Graphs Derived from Combinatorial Designs
• A restriction on the parameters of a subquadrangle
• A Note on Fisher's Inequality for Balanced Incomplete Block Designs
• The Nonexistence of Certain Finite Projective Planes
• On the Structure of Balanced Incomplete Block Designs
• Combinatorial Properties of Group Divisible Incomplete Block Designs
• On some Theorems in Combinatorics Relating to Incomplete Block Designs
• An Embedding Theorem for Balanced Incomplete Block Designs
• A new 5‐arc‐transitive cubic graph