Subsets of a finite set that almost always intersect each other in \(\lambda\) elements
From MaRDI portal
Publication:1356776
DOI10.1016/S0012-365X(96)00200-2zbMath0883.05108MaRDI QIDQ1356776
Publication date: 23 February 1998
Published in: Discrete Mathematics (Search for Journal in Brave)
Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A short proof of the nonuniform Ray-Chaudhuri-Wilson inequality
- Lehman's forbidden minor characterization of ideal 0-1 matrices
- A short proof of Fisher's inequality
- A new proof of a theorem of Graham and Pollak
- Clique partitions of the cocktail party graph
- A sharpening of Fisher's inequality
- Multicolored forests in bipartite decompositions of graphs
- Subsets of a finite set that intersect each other in at most one element
- A theorem on block designs
- An extension of a theorem of the Bruijn and Erdős on combinatorial designs
- Combinatorial designs and related systems
- Applying a proof of tverberg to complete bipartite decompositions of digraphs and multigraphs
- On the decomposition ofkn into complete bipartite graphs
- On the decomposition of Kn into complete m‐partite graphs
- On some Theorems in Combinatorics Relating to Incomplete Block Designs
This page was built for publication: Subsets of a finite set that almost always intersect each other in \(\lambda\) elements
