Block-transitive \(t\)-designs. I: Point-imprimitive designs
type: Item
instance of: scholarly article
title: Block-transitive \(t\)-designs. I: Point-imprimitive designs
zbMATH Open document ID: 0780.05006
DOI: 10.1016/0012-365X(93)90051-T
author: Peter J. Cameron
author: Cheryl E. Praeger
published in: Discrete Mathematics
publication date: 1994-01-11T00:00:00Z
review text: The authors study block-transitive, point-imprimitive \(t\)- \((v,k,\lambda)\)-designs and give bounds on the size of \(v\) in terms of \(k\). In particular, they give a proof for the bound obtained by \textit{A. Delandtsheer} and \textit{J. Doyen} [``Most block-transitive \(t\)-designs are point-primitive'', Geom. Dedicata 29, No. 3, 307-310 (1989; Zbl 0673.05010)] in the case \(t=2\) and study the case of equality in this bound. They obtain stronger bounds than Delandtsheer and Doyen provided that either \(t\geq 3\) or the design is flag-transitive.
reviewed by: Dieter Jungnickel
Mathematics Subject Classification ID: 05B05
Mathematics Subject Classification ID: 05E20
zbMATH DE Number: 417461
zbMATH Keywords: \(t\)-designs
zbMATH Keywords: point-imprimitive designs
zbMATH Keywords: flag-transitive design
zbMATH Keywords: block- transitive design
Wikidata QID: Q56988310
MaRDI profile type: Publication
cites work: Finite Permutation Groups and Finite Simple Groups
cites work: On the degrees of primitive permutation groups
cites work: Flag-transitivity and primitivity
cites work: Most block-transitive t-designs are point-primitive
cites work: A theorem on flows in networks
cites work: Q5289114
cites work: Q5184922
cites work: On t-designs
cites work: Combinatorial Properties of Matrices of Zeros and Ones
cites work: Q3907748
full work available at URL: 0012-365x(93)90051-t
OpenAlex ID: W1986816276
description: scientific article; zbMATH DE number 417461