Subsets of a finite set that intersect each other in at most one element
From MaRDI portal
(Redirected from Publication:1844835)
Cites work
- A Recurring Theorem on Determinants
- An extension of a theorem of the Bruijn and Erdős on combinatorial designs
- Combinatorial Properties of Group Divisible Incomplete Block Designs
- scientific article; zbMATH DE number 3215568 (Why is no real title available?)
- scientific article; zbMATH DE number 3257050 (Why is no real title available?)
- On the Construction of Group Divisible Incomplete Block Designs
- On the non-existence of a class of configurations which are nearly generalized n-gons
- On the number of absolute points of a correlation
- Square λ-Linked Designs
- Symmetric designs and related configurations
- Variants of Cyclic Difference Sets
Cited in
(14)- A note on the structure of pairwise balanced designs
- Clique partitions of the cocktail party graph
- An elliptic semiplane
- A Fisher type inequality
- A sharpening of Fisher's inequality
- Tactical constructions
- On a theorem of Ryser
- Subsets of a finite set that almost always intersect each other in elements
- Geometric matrices and an inequality for (0,1)-matrices
- On the solution of multiattribute problems involving counting in intersecting sets
- On a class of partial planes related to biplanes
- Octopuses in the Boolean cube: families with pairwise small intersections. I
- Octopuses in the Boolean cube: families with pairwise small intersections. II
- A method of finding automorphism groups of endomorphism monoids of relational systems.
This page was built for publication: Subsets of a finite set that intersect each other in at most one element
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1844835)
