Abstract
An (α,n)-arc in a 2-design is a set ofn points of the design such that any block intersects it in at most α points. For such an arc,n is bounded by 1+(r(α−1)/λ), with equality if and only if every block meets the arc in either 0 or α points. An (α,n) arc with equality in above is said to be maximal.
A maximal block arc can be dually defined. This generalizes the notion of an oval (α=2) in a symmetric design due to Asmus and van Lint. The aim of this paper is to study the infinite family of possibly extendable symmetric designs other than the Hadamard design family and their related designs using maximal arcs. It is shown that the extendability corresponds to the existence of a proper family of maximal arcs. A natural duality between point and block arcs is established, which among other things implies a result of Cameron and van Lint that extendability of a given design in this family is equivalent to extendability of its dual. Similar results are proved for other related designs.
Similar content being viewed by others
References
Asmus, B.F., van Lint, J.H.: Ovals in projective designs. J. Comb. Theory (A)27, 307–324 (1979)
Baartmans, A., Shrikhande, M.S.: Designs with no three mutually disjoint blocks. Discrete Math.40, 129–139 (1982)
Cameron, P.J.: Extending symmetric designs. J. Comb. Theory (A)14, 215–220 (1973)
Cameron, P.J., van Lint, J.H.: Graphs, codes and designs. London Math. Soc. Lect. Note Ser.43 (1980)
Dembowski, P.: Finite Geometries. New York: Springer 1968
Frankl, P.: Personal communication.
Majumdar, K.N.: On some theorems in combinatorics relating to incomplete block designs. Ann. Math. Stat.24, 377–389 (1953)
Roghelia, N.N., Sane, S.S.: Classification of (16, 6, 2) designs by ovals. Discrete Math. (to appear)
Ryser, H.J.: An extension of a theorem of de Bruijn and Erdös on combinatorial designs. J. Algebra10, 246–261 (1968)
Sane, S.S.: On a class of symmetric designs. In: Combinatorics and Applications (Proc. Seminar on Combinatorics and Applications 1982), pp. 292–302. Calcutta: Indian Statistical Institute 1984
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Sane, S.S., Shrikhande, S.S. & Singhi, N.M. Maximal arcs in designs. Graphs and Combinatorics 1, 97–106 (1985). https://doi.org/10.1007/BF02582933
Issue Date:
DOI: https://doi.org/10.1007/BF02582933