An intersection problem for codes
From MaRDI portal
Publication:922561
DOI10.1016/0012-365X(90)90369-SzbMath0711.05045MaRDI QIDQ922561
Publication date: 1990
Published in: Discrete Mathematics (Search for Journal in Brave)
Cites Work
- The exact bound in the Erdős-Ko-Rado theorem
- Extremal hypergraph problems and convex hulls
- An analogue of the Erdoes-Ko-Rado theorem for the Hamming schemes H(n,q)
- The proof of a conjecture of G. O. H. Katona
- On families of finite sets with bounds on unions and intersections
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- The Erdös-Ko-Rado Theorem for Integer Sequences
- Intersection theorems for systems of finite sets
- Families of Non-disjoint subsets
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: An intersection problem for codes
