An analogue of the Erdős-Ko-Rado theorem for weak compositions

DOI10.1016/J.DISC.2013.07.012MaRDI QIDQ389467zbMATH OpenOpenAlexFDO

Authors Cheng Yeaw Ku, K. B. Wong

Publication date 20 January 2014

Published in Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

Erdős-Ko-Radoweak compositions

Mathematics Subject Classification ID

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

Recommendations

• An analogue of the Hilton-Milner theorem for weak compositions
• A short proof of an Erdős-Ko-Rado theorem for compositions
• On \(r\)-cross \(t\)-intersecting families for weak compositions
• A multiply intersecting Erdős-Ko-Rado theorem -- the principal case
• A general 2-part Erdős-Ko-Rado theorem

Cites work

• A new proof of the Erdős-Ko-Rado theorem for intersecting families of permutations
• An analogue of the Erdoes-Ko-Rado theorem for the Hamming schemes H(n,q)
• An analogue of the Hilton-Milner theorem for set partitions
• An Erdős--Ko--Rado theorem for partial permutations
• An Erdős-Ko-Rado-type theorem in Coxeter groups.
• Compression and Erdős-Ko-Rado graphs
• Erdős-Ko-Rado theorems for chordal graphs and trees
• Erdős-Ko-Rado theorems for permutations and set partitions
• Erdős-Ko-Rado theorems for simplicial complexes
• Erdős-Ko-Rado-type theorems for colored sets
• Extremal t -intersecting sub-families of hereditary families
• Graphs with the Erdős-Ko-Rado property
• scientific article; zbMATH DE number 5130735 (Why is no real title available?)
• scientific article; zbMATH DE number 3621717 (Why is no real title available?)
• Intersecting families in the alternating group and direct product of symmetric groups
• Intersecting families of permutations
• Intersecting families of permutations
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• On t-intersecting families of signed sets and permutations
• On cross-intersecting families of set partitions
• On the maximum number of permutations with given maximal or minimal distance
• Shadows and intersections in vector spaces
• Some Erdős-Ko-Rado theorems for injections
• Stability for t-intersecting families of permutations
• Stable sets of maximal size in Kneser-type graphs
• The complete intersection theorem for systems of finite sets
• The diametric theorem in Hamming spaces---optimal anticodes
• The Erdős-Ko-Rado properties of various graphs containing singletons
• The Erdős-Ko-Rado theorem for vector spaces
• The exact bound in the Erdős-Ko-Rado theorem

Cited in

(16)

• The Hilton-Milner theorem for attenuated spaces
• Erdős-Ko-Rado theorems on the weak Bruhat lattice
• Erdős-Ko-Rado theorems for set partitions with certain block size
• On \(r\)-cross \(t\)-intersecting families for weak compositions
• A Deza-Frankl type theorem for set partitions
• The maximum product of sizes of cross-intersecting families
• On the intersection density of the symmetric group acting on uniform subsets of small size
• A short proof of an Erdős-Ko-Rado theorem for compositions
• An Erdős-Ko-Rado theorem for permutations with fixed number of cycles
• Co-Nondeterminism in Compositions
• On diversity of certain \(t\)-intersecting families
• An analogue of the Hilton-Milner theorem for weak compositions
• Diversity and intersecting theorems for weak compositions
• An analogue of the Erdős matching conjecture for weak compositions
• More on the Erdős-Ko-Rado theorem for integer sequences
• A non-trivial intersection theorem for permutations with fixed number of cycles

This page was built for publication: An analogue of the Erdős-Ko-Rado theorem for weak compositions

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