A non-trivial intersection theorem for permutations with fixed number of cycles
type: Item
instance of: scholarly article
title: A non-trivial intersection theorem for permutations with fixed number of cycles
zbMATH Open document ID: 1327.05006
author: Cheng Yeaw Ku
author: K. B. Wong
published in: Discrete Mathematics
publication date: 2015-12-08T00:00:00Z
Mathematics Subject Classification ID: 05A05
Mathematics Subject Classification ID: 05D05
zbMATH DE Number: 6517669
zbMATH Keywords: \(t\)-intersecting family
zbMATH Keywords: Frankl-Hilton-Milner
zbMATH Keywords: Erdős-Ko-Rado
zbMATH Keywords: permutations
MaRDI profile type: Publication
full work available at URL: j.disc.2015.09.032
OpenAlex ID: W2194589919
cites work: The complete nontrivial-intersection theorem for systems of finite sets
cites work: The complete intersection theorem for systems of finite sets
cites work: The diametric theorem in Hamming spaces---optimal anticodes
cites work: On cross-intersecting families of sets
cites work: Extremal t -intersecting sub-families of hereditary families
cites work: On \(t\)-intersecting families of signed sets and permutations
cites work: The Erdős-Ko-Rado properties of various graphs containing singletons
cites work: Some Erdős-Ko-Rado theorems for injections
cites work: Intersecting families of permutations
cites work: Shadows and intersections in vector spaces
cites work: On the maximum number of permutations with given maximal or minimal distance
cites work: Stability for \(t\)-intersecting families of permutations
cites work: INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
cites work: Q4184835
cites work: On intersecting families of finite sets
cites work: Non-trivial intersecting families
cites work: On r-Cross Intersecting Families of Sets
cites work: The Erdős-Ko-Rado theorem for vector spaces
cites work: A new proof of the Erdős-Ko-Rado theorem for intersecting families of permutations
cites work: SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
cites work: Q3424782
cites work: Compression and Erdős-Ko-Rado graphs
cites work: Graphs with the Erdős-Ko-Rado property
cites work: Erdős-Ko-Rado theorems for chordal graphs and trees
cites work: Shadows and intersections: Stability and new proofs
cites work: An Erdős--Ko--Rado theorem for partial permutations
cites work: Erdős-Ko-Rado theorems for permutations and set partitions
cites work: Intersecting families in the alternating group and direct product of symmetric groups
cites work: On cross-intersecting families of set partitions
cites work: On \(r\)-cross intersecting families of set
cites work: An analogue of the Hilton-Milner theorem for set partitions
cites work: An analogue of the Erdős-Ko-Rado theorem for weak compositions
cites work: An Erdős-Ko-Rado theorem for permutations with fixed number of cycles
cites work: On \(r\)-cross \(t\)-intersecting families for weak compositions
cites work: AN ANALOGUE OF THE HILTON-MILNER THEOREM FOR WEAK COMPOSITIONS
cites work: Stable sets of maximal size in Kneser-type graphs
cites work: Erdős-Ko-Rado-type theorems for colored sets
cites work: The exact bound in the Erdős-Ko-Rado theorem for cross-intersecting families
cites work: An analogue of the Erdoes-Ko-Rado theorem for the Hamming schemes H(n,q)
cites work: A new generalization of the Erdős-Ko-Rado theorem
cites work: A product version of the Erdős-Ko-Rado theorem
cites work: An Erdős-Ko-Rado-type theorem in Coxeter groups.
cites work: Cross-intersecting families and primitivity of symmetric systems
cites work: The exact bound in the Erdős-Ko-Rado theorem
cites work: Erdős-Ko-Rado theorems for simplicial complexes
DOI: 10.1016/J.DISC.2015.09.032
description: scientific article; zbMATH DE number 6517669