A generalization of the Erdős-Ko-Rado theorem to \(t\)-designs in certain semilattices

DOI10.1016/j.disc.2012.01.032zbMath1242.05033arXiv1201.5037OpenAlexW2167104476MaRDI QIDQ418897

Sho Suda

Publication date: 30 May 2012

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1201.5037

zbMATH Keywords

designErdős-Ko-Rado theoremsemilatticeintersection family

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Absolute planes in metric geometry (51F05) Generalizations of lattices (06B75)

Related Items (7)

The Katona cycle proof of the Erdős-Ko-Rado theorem and its possibilities ⋮ The Erdős-Ko-Rado theorem for finite affine spaces ⋮ Anzahl formulas of subspaces in symplectic spaces and their applications ⋮ Erdős-Ko-Rado theorems in certain semilattices ⋮ The Erdős-Ko-Rado theorem for singular linear spaces ⋮ Anzahl theorems in geometry oft-singular classical groups and their applications ⋮ Erdős-Ko-Rado theorems on the weak Bruhat lattice

Cites Work

• Unnamed Item
• Unnamed Item
• The exact bound in the Erdős-Ko-Rado theorem
• An Erdős--Ko--Rado theorem for partial permutations
• Erdős-Ko-Rado theorems for permutations and set partitions
• A new proof of the Erdős-Ko-Rado theorem for intersecting families of permutations
• On the nonbinary Johnson scheme
• The Erdős-Ko-Rado theorem for vector spaces
• Designs over finite fields
• An analogue of the Erdős-Ko-Rado theorem for the distance-regular graphs of bilinear forms
• An analogue of the Erdoes-Ko-Rado theorem for the Hamming schemes H(n,q)
• An extension of the Erdoes, Ko, Rado theorem to t-designs
• 2-designs over \(GF(q)\)
• Intersection theorems for systems of finite vector spaces
• Association schemes and t-designs in regular semilattices
• Bilinear forms over a finite field, with applications to coding theory
• Orthogonal arrays. Theory and applications
• Erdős-Ko-Rado-type results over \(J_q(n,d),H_q(n,d)\) and their designs
• An Erdős-Ko-Rado theorem for signed sets
• Width and dual width of subsets in polynomial association schemes
• Systematic construction of \(q\)-analogs of \(t\)-\((v,k,\lambda)\)-designs
• An Erdős-Ko-Rado theorem for restricted signed sets
• The Erdős-Ko-Rado theorem for twisted Grassmann graphs
• 2-designs over \(GF(2^ m)\)
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• Intersecting families of permutations
• Intersecting families of permutations

This page was built for publication: A generalization of the Erdős-Ko-Rado theorem to \(t\)-designs in certain semilattices