Subsets of a finite set that intersect each other in at most one element
type: Item
instance of: scholarly article
title: Subsets of a finite set that intersect each other in at most one element
zbMATH Open document ID: 0285.05003
DOI: 10.1016/0097-3165(74)90028-4
published in: Journal of Combinatorial Theory. Series A
publication date: 1974-01-01T00:00:00Z
Mathematics Subject Classification ID: 05A05
Mathematics Subject Classification ID: 62K10
Mathematics Subject Classification ID: 05B25
zbMATH DE Number: 3446894
MaRDI profile type: Publication
full work available at URL: 0097-3165(74)90028-4
OpenAlex ID: W2053554186
cites work: Combinatorial Properties of Group Divisible Incomplete Block Designs
cites work: On the Construction of Group Divisible Incomplete Block Designs
cites work: Q5545191
cites work: On the number of absolute points of a correlation
cites work: On the non-existence of a class of configurations which are nearly generalized n-gons
cites work: An extension of a theorem of the Bruijn and Erdős on combinatorial designs
cites work: Symmetric designs and related configurations
cites work: Variants of Cyclic Difference Sets
cites work: A Recurring Theorem on Determinants
cites work: Q5342712
cites work: Square λ-Linked Designs
author: Herbert John Ryser
description: scientific article; zbMATH DE number 3446894