Quasi-symmetric 3-designs with triangle-free graph (Q757376): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Removed claim: reviewed by (P1447): Item:Q1168024 |
||
Property / reviewed by | |||
Property / reviewed by: B. L. Raktoe / rank | |||
Revision as of 14:15, 22 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Quasi-symmetric 3-designs with triangle-free graph |
scientific article |
Statements
Quasi-symmetric 3-designs with triangle-free graph (English)
0 references
1991
0 references
A t-(v,k,\(\lambda\))-design is collection of k-subsets (called blocks) of a v-set (the elements of which are called points) such that any t-tuple of points occurs in exactly \(\lambda\) blocks. A t-design with two block intersection numbers is said to be quasi-symmetric. The author establishes the following result: Let D be a quasi-symmetric 3-design with intersection numbers x,y \((0\leq x<y<k)\), then the following are equivalent: (i) there are no three distinct blocks of D such that any two of them intersect in x points; (ii) D is a Hadamard 3-design or D has a parameter set (v,k,\(\lambda\)) where \(v=(\lambda +2)(\lambda^ 2+4\lambda +2)+1\), \(k=\lambda^ 2+3\lambda +2\) and \(\lambda =1,2,..\). or D is a complement of one of these designs.
0 references
balanced incomplete block designs
0 references
quasi symmetric t-designs
0 references
triangle free graph
0 references
t-(v,k,\(\lambda \) )-design
0 references
Hadamard 3-design
0 references