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

DOI10.1016/S0195-6698(86)80025-7zbMath0634.05004OpenAlexW2007932648MaRDI QIDQ1096631

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

permutationsBoolean latticepartial ordermaximumrank of an elementWhitney numberst-intersecting familyt-intersecting subset

Mathematics Subject Classification ID

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

Related Items (6)

Some greedy \(t\)-intersecting families of finite sequences ⋮ Multiple cross-intersecting families of signed sets ⋮ Compression and Erdős-Ko-Rado graphs ⋮ A generalization of Talbot's theorem about King Arthur and his knights of the round table ⋮ An intersection-union theorem for integer sequences ⋮ The \(t\)-intersection problem in the truncated Boolean lattice

Cites Work

• The exact bound in the Erdős-Ko-Rado theorem
• An Erdős-Ko-Rado theorem for the subcubes of a cube
• Intersecting Sperner families and their convex hulls
• An analogue of the Erdoes-Ko-Rado theorem for the Hamming schemes H(n,q)
• Intersection theorems for systems of finite vector spaces
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• The Erdös-Ko-Rado Theorem for Integer Sequences
• Intersection theorems for systems of finite sets
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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