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

DOI10.1016/J.DISC.2012.01.032MaRDI QIDQ418897zbMATH OpenOpenAlexFDO

Authors 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

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)

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.

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

Cites work

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

Cited in

(10)

• The Erdős-Ko-Rado theorem for singular linear spaces
• Using the existence of \(t\)-designs to prove Erdős-Ko-Rado
• 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
• Erdős-Ko-Rado theorems on the weak Bruhat lattice
• Anzahl theorems in geometry of \(t\)-singular classical groups and their applications
• 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

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)