An analogue of the Erdoes-Ko-Rado theorem for the Hamming schemes H(n,q)
From MaRDI portal
Publication:1163019
DOI10.1016/0097-3165(82)90054-1zbMath0483.05002OpenAlexW1969693428MaRDI QIDQ1163019
Publication date: 1982
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(82)90054-1
Related Items (37)
The maximum product of sizes of cross-intersecting families ⋮ On symmetric intersecting families of vectors ⋮ The Katona cycle proof of the Erdős-Ko-Rado theorem and its possibilities ⋮ An Erdős-Ko-Rado theorem for integer sequences of given rank ⋮ An analogue of the Erdős-Ko-Rado theorem for the distance-regular graphs of bilinear forms ⋮ On Chvàtal's conjecture and a conjecture on families of signed sets ⋮ Cross-Intersecting Families of Vectors ⋮ An analogue of the Erdős-Ko-Rado theorem for weak compositions ⋮ An Erdős-Ko-Rado theorem for permutations with fixed number of cycles ⋮ Some inequalities concerning cross-intersecting families of integer sequences ⋮ The maximum product of weights of cross-intersecting families ⋮ A non-trivial intersection theorem for permutations with fixed number of cycles ⋮ A generalization of the Erdős-Ko-Rado theorem to \(t\)-designs in certain semilattices ⋮ Erdős-Ko-Rado theorems for chordal graphs and trees ⋮ An Erdős-Ko-Rado theorem for cross \(t\)-intersecting families ⋮ An intersection problem for codes ⋮ The Erdős-Ko-Rado theorem for twisted Grassmann graphs ⋮ Multiply-intersecting families ⋮ A sharp bound for the product of weights of cross-intersecting families ⋮ Cross-intersecting pairs of hypergraphs ⋮ Diametric theorems in sequence spaces ⋮ Multiple cross-intersecting families of signed sets ⋮ All 2-transitive groups have the EKR-module property ⋮ Erdös–Ko–Rado Theorem—22 Years Later ⋮ Classification of subsets with minimal width and dual width in Grassmann, bilinear forms and dual polar graphs ⋮ Compression and Erdős-Ko-Rado graphs ⋮ Invitation to intersection problems for finite sets ⋮ Erdős-Ko-Rado theorems for set partitions with certain block size ⋮ The diametric theorem in Hamming spaces---optimal anticodes ⋮ On \(t\)-intersecting families of signed sets and permutations ⋮ An Erdős-Ko-Rado theorem for the subcubes of a cube ⋮ The Erdős-Ko-Rado properties of set systems defined by double partitions ⋮ A cross‐intersection theorem for subsets of a set ⋮ Erdős-Ko-Rado-type results over \(J_q(n,d),H_q(n,d)\) and their designs ⋮ More on the Erdős-Ko-Rado theorem for integer sequences ⋮ A Deza-Frankl type theorem for set partitions ⋮ Cross-intersecting families of vectors
Cites Work
This page was built for publication: An analogue of the Erdoes-Ko-Rado theorem for the Hamming schemes H(n,q)
