Subsets of a finite set that intersect each other in at most one element

DOI10.1016/0097-3165(74)90028-4zbMath0285.05003OpenAlexW2053554186MaRDI QIDQ1844835

H. J. Ryser

Publication date: 1974

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0097-3165(74)90028-4

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Combinatorial aspects of finite geometries (05B25) Statistical block designs (62K10)

Related Items (13)

Clique partitions of the cocktail party graph ⋮ Subsets of a finite set that almost always intersect each other in \(\lambda\) elements ⋮ A method of finding automorphism groups of endomorphism monoids of relational systems. ⋮ Octopuses in the Boolean cube: families with pairwise small intersections. I ⋮ An elliptic semiplane ⋮ A Fisher type inequality ⋮ A sharpening of Fisher's inequality ⋮ On a class of partial planes related to biplanes ⋮ Tactical constructions ⋮ Geometric matrices and an inequality for (0,1)-matrices ⋮ On a theorem of Ryser ⋮ On the solution of multiattribute problems involving counting in intersecting sets ⋮ A note on the structure of pairwise balanced designs

Cites Work

• Unnamed Item
• Unnamed Item
• On the number of absolute points of a correlation
• An extension of a theorem of the Bruijn and Erdős on combinatorial designs
• On the non-existence of a class of configurations which are nearly generalized n-gons
• Symmetric designs and related configurations
• Variants of Cyclic Difference Sets
• Square λ-Linked Designs
• A Recurring Theorem on Determinants
• Combinatorial Properties of Group Divisible Incomplete Block Designs
• On the Construction of Group Divisible Incomplete Block Designs

This page was built for publication: Subsets of a finite set that intersect each other in at most one element