An extension of the Erdoes, Ko, Rado theorem to t-designs

DOI10.1016/0097-3165(82)90055-3zbMath0494.05005OpenAlexW2018989615MaRDI QIDQ1168972

B. M. I. Rands

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)90055-3

zbMATH Keywords

combinatorial functions and designst-(v,k,lambda) design

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) General block designs in finite geometry (51E05)

Related Items (13)

Maximal sets of \(k\)-spaces pairwise intersecting in at least a \((k-2)\)-space ⋮ On maximum intersecting sets in direct and wreath product of groups ⋮ An extension of the Erdős-Ko-Rado theorem to set-wise 2-intersecting families of perfect matchings ⋮ Computational complexity of reconstruction and isomorphism testing for designs and line graphs ⋮ The minimum number of nonnegative edges in hypergraphs ⋮ Hilton-Milner results in projective and affine spaces ⋮ A generalization of the Erdős-Ko-Rado theorem to \(t\)-designs in certain semilattices ⋮ Theorems of Erdős-Ko-Rado type in geometrical settings ⋮ A new proof for the Erdős-Ko-Rado theorem for the alternating group ⋮ Erdős-Ko-Rado theorems in certain semilattices ⋮ A new proof of the Erdős-Ko-Rado theorem for intersecting families of permutations ⋮ Erdős-Ko-Rado-type results over \(J_q(n,d),H_q(n,d)\) and their designs ⋮ The largest Erdős-Ko-Rado sets in \(2-(v,k,1)\) designs

Cites Work

• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• Unnamed Item

This page was built for publication: An extension of the Erdoes, Ko, Rado theorem to t-designs