A short proof of an Erdős-Ko-Rado theorem for compositions

DOI10.1016/j.disc.2014.06.009zbMath1298.05007OpenAlexW2005932670MaRDI QIDQ400403

Peter Borg

Publication date: 21 August 2014

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

Full work available at URL: https://doi.org/10.1016/j.disc.2014.06.009

zbMATH Keywords

intersecting familyErdős-Ko-Rado theoremcomposition

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Extremal set theory (05D05)

Cites Work

• An analogue of the Erdős-Ko-Rado theorem for weak compositions
• Cross-intersecting families and primitivity of symmetric systems
• The complete intersection theorem for systems of finite sets
• The exact bound in the Erdős-Ko-Rado theorem
• Compression and Erdős-Ko-Rado graphs
• Erdős-Ko-Rado from Kruskal-Katona
• The maximum sum and the maximum product of sizes of cross-intersecting families
• A simple proof of the Erdős-Chao Ko-Rado theorem
• Erdös–Ko–Rado Theorem—22 Years Later
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• Extremal t -intersecting sub-families of hereditary families
• Intersection theorems for systems of finite sets
• SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A short proof of an Erdős-Ko-Rado theorem for compositions