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

DOI10.1016/J.DISC.2012.01.032zbMATH Open1242.05033arXiv1201.5037OpenAlexW2167104476MaRDI QIDQ418897FDOQ418897

Sho Suda

Publication date: 30 May 2012

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

Abstract: The ErdH{o}s--Ko--Rado theorem is extended to designs in semilattices with certain conditions. As an application, we show the intersection theorems for the Hamming schemes, the Johnson schemes, bilinear forms schemes, Grassmann schemes, signed sets, partial permutations and restricted signed sets.

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

Recommendations

• Erdős-Ko-Rado theorems in certain semilattices
• An extension of the Erdős-Ko-Rado theorem to uniform set partitions
• Using the existence of \(t\)-designs to prove Erdős-Ko-Rado
• A generalization of the Erdős-Ko-Rado theorem
• A general 2-part Erdős-Ko-Rado theorem

zbMATH Keywords

designsemilatticeintersection familyErdős-Ko-Rado theorem

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (9)

• Erdős-Ko-Rado theorems in certain semilattices
• The Erdős-Ko-Rado theorem for finite affine spaces
• The largest Erdős-Ko-Rado sets in \(2-(v,k,1)\) designs
• Anzahl theorems in geometry oft-singular classical groups and their applications
• Erdős-Ko-Rado theorems on the weak Bruhat lattice
• The Katona cycle proof of the Erdős-Ko-Rado theorem and its possibilities
• Anzahl formulas of subspaces in symplectic spaces and their applications
• PBIB-designs from certain subsets of distance-regular graphs
• The Erdős-Ko-Rado theorem for singular linear spaces

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q418897)