Conditions for the parameters of the block graph of quasi-symmetric designs
Summary: A quasi-symmetric design (QSD) is a \(2\mathrm{-}(v,k,\lambda)\) design with intersection numbers \(x\) and \(y\) with \(x< y\). The block graph of such a design is formed on its blocks with two distinct blocks being adjacent if they intersect in \(y\) points. It is well known that the block graph of a QSD is a strongly regular graph (SRG) with parameters \((b,a,c,d)\) with smallest eigenvalue \( -m =-\frac{k-x}{y-x}\). { }The classification result of SRGs with smallest eigenvalue \(-m\), is used to prove that for a fixed pair \((\lambda\geq 2,m\geq 2)\), there are only finitely many QSDs. This gives partial support towards Marshall Hall Jr.'s conjecture, that for a fixed \(\lambda\geq 2\), there exist finitely many symmetric \((v, k, \lambda)\)-designs.{ }We classify QSDs with \(m=2\) and characterize QSDs whose block graph is the complete multipartite graph with \(s\) classes of size \(3\).~We rule out the possibility of a QSD whose block graph is the Latin square graph \(LS_m (n)\) or complement of \(LS_m (n)\), for \(m=3,4\). { }SRGs with no triangles have long been studied and are of current research interest. The characterization of QSDs with triangle-free block graph for \(x=1\) and \(y=x+1\) is obtained and the non-existence of such designs with \(x=0\) or \(\lambda > 2(x+2)\) or if it is a 3-design is proven. The computer algebra system Mathematica is used to find parameters of QSDs with triangle-free block graph for \(2\leq m \leq 100\). We also give the parameters of QSDs whose block graph parameters are \((b,a,c,d)\) listed in Brouwer's table of SRGs.
- Characterization of quasi-symmetric designs with eigenvalues of their block graphs
- Non-existence of quasi-symmetric designs with restricted block graphs
- Quasi-symmetric designs with fixed difference of block intersection numbers
- Quasi‐Symmetric Designs with Good Blocks
- Quasi-symmetric designs with good blocks and intersection number one
- scientific article; zbMATH DE number 4008401
- Quasi-symmetric designs with the difference of block intersection numbers two
- Combinatorial methods for constructing bipartite uniform minimal quasicomplete graphs (symmetrical block designs)
- Quasi-symmetric balanced incomplete block designs
- A new quasi-symmetric 2-(56,\,16,\,6) design obtained from codes
- A note on triangle-free quasi-symmetric designs
- Binary codes and quasi-symmetric designs
- Binary representations of regular graphs
- Combinatorics of symmetric designs
- Dale Mesner, Higman \& Sims, and the strongly regular graph with parameters \((100,22,0,6)\)
- Designs with no three mutually disjoint blocks
- Finiteness questions in quasi-symmetric designs
- Finiteness results in triangle-free quasi-symmetric designs
- scientific article; zbMATH DE number 3836050 (Why is no real title available?)
- scientific article; zbMATH DE number 4172982 (Why is no real title available?)
- scientific article; zbMATH DE number 4150175 (Why is no real title available?)
- scientific article; zbMATH DE number 3970750 (Why is no real title available?)
- scientific article; zbMATH DE number 50655 (Why is no real title available?)
- scientific article; zbMATH DE number 51841 (Why is no real title available?)
- scientific article; zbMATH DE number 1219592 (Why is no real title available?)
- scientific article; zbMATH DE number 1043885 (Why is no real title available?)
- scientific article; zbMATH DE number 874536 (Why is no real title available?)
- Non existence of triangle free quasi-symmetric designs.
- Non-Existence of Some Unsymmetrical Partially Balanced Incomplete Block Designs
- On quasi-symmetric designs with intersection difference three
- Problems in algebraic combinatorics
- Quasi-symmetric 2,3,4-designs
- Quasi-symmetric 3-designs with triangle-free graph
- Quasi-symmetric designs related to the triangular graph
- Quasi-symmetric designs with fixed difference of block intersection numbers
- Quasi-symmetric designs with the difference of block intersection numbers two
- Spectra of graphs
- Strongly Regular Graphs Derived from Combinatorial Designs
- Strongly regular graphs with (-1, 1, 0) adjacency matrix having eigenvalue 3
- Strongly regular graphs with smallest eigenvalue -m
- The structure of triangle-free quasi-symmetric designs
- There is no (46, 6, 1) block design
- Non-existence of quasi-symmetric designs with restricted block graphs
- Parametric restrictions on quasi-symmetric designs
- Characterization of quasi-symmetric designs with eigenvalues of their block graphs
- Ovoids of generalized quadrangles of order and Delsarte cocliques in related strongly regular graphs
- The adjacency codes of the first yellow graphs
- Non-existence of quasi-symmetric designs having certain pseudo-geometric block graphs
- New quasi-symmetric designs by the Kramer-Mesner method
- Quasi-symmetric designs on 56 points
- Non-derivable strongly regular graphs from quasi-symmetric designs
This page was built for publication: Conditions for the parameters of the block graph of quasi-symmetric designs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2256133)
