An Erdős-Ko-Rado theorem for integer sequences of given rank

DOI10.1016/S0195-6698(86)80025-7MaRDI QIDQ1096631zbMATH OpenOpenAlexFDO

Authors Konrad Engel, Peter Frankl

Publication date 1986

Published in European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0195-6698(86)80025-7

zbMATH Keywords

Boolean latticemaximumpartial orderpermutationsrank of an elementt-intersecting familyt-intersecting subsetWhitney numbers

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Combinatorial identities, bijective combinatorics (05A19) Combinatorial inequalities (05A20)

Review text

The subject of the paper is the set E(k,n) of n-permutations with repetition from k elements. There are defined and considered such notions as the partial order on E(k,n), the rank of an element from E(k,n), the t-intersecting subset \(E_ l(k,n)\) of E(k,n) (which is the l-th level of E(k,n)), the t-intersecting family in E(k,n), the size of \(E_ l(k,n)\) and the support of an element from E(k,n). As special cases they are mentioned e.g. the Boolean lattice and the Whitney numbers. The main part of the paper is devoted to the proofs of assertions about the maximum of a t-intersecting family in \(E_ l(k,n)\). There is given an open problem too.

Recommendations

• An Erdős--Ko--Rado theorem for partial permutations
• Intersecting generalised permutations
• Erdős-Ko-Rado theorems on the weak Bruhat lattice
• An Erdős-Ko-Rado theorem for permutations with fixed number of cycles
• Erdős-Ko-Rado theorems for permutations and set partitions

Cites work

• An analogue of the Erdoes-Ko-Rado theorem for the Hamming schemes H(n,q)
• An Erdős-Ko-Rado theorem for the subcubes of a cube
• scientific article; zbMATH DE number 3621717 (Why is no real title available?)
• scientific article; zbMATH DE number 3636041 (Why is no real title available?)
• scientific article; zbMATH DE number 3327849 (Why is no real title available?)
• scientific article; zbMATH DE number 3351583 (Why is no real title available?)
• Intersecting Sperner families and their convex hulls
• Intersection theorems for systems of finite sets
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• Intersection theorems for systems of finite vector spaces
• The Erdös-Ko-Rado Theorem for Integer Sequences
• The exact bound in the Erdős-Ko-Rado theorem

Cited in

(11)

• A generalization of Talbot's theorem about King Arthur and his knights of the round table
• An intersection-union theorem for integer sequences
• Some greedy t-intersecting families of finite sequences
• Compression and Erdős-Ko-Rado graphs
• The \(t\)-intersection problem in the truncated Boolean lattice
• The Erdős-Ko-Rado theorem for 2-pointwise and 2-setwise intersecting permutations
• scientific article; zbMATH DE number 3526750 (Why is no real title available?)
• scientific article; zbMATH DE number 1092064 (Why is no real title available?)
• The Erdős-Ko-Rado theorem for integer sequences
• More on the Erdős-Ko-Rado theorem for integer sequences
• Multiple cross-intersecting families of signed sets

This page was built for publication: An Erdős-Ko-Rado theorem for integer sequences of given rank

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