On \(t\)-intersecting families of signed sets and permutations
type: Item
instance of: scholarly article
title: On \(t\)-intersecting families of signed sets and permutations
zbMATH Open document ID: 1216.05003
author: Peter Borg
published in: Discrete Mathematics
publication date: 2009-06-23T00:00:00Z
Mathematics Subject Classification ID: 05A05
zbMATH DE Number: 5569077
zbMATH Keywords: Erdős-Ko-Rado
zbMATH Keywords: intersecting family
zbMATH Keywords: permutation
zbMATH Keywords: signed set
MaRDI profile type: Publication
full work available at URL: j.disc.2008.09.039
OpenAlex ID: W2151762588
cites work: The complete intersection theorem for systems of finite sets
cites work: The diametric theorem in Hamming spaces---optimal anticodes
cites work: Q4047583
cites work: An Erdős-Ko-Rado theorem for signed sets
cites work: Intersecting systems of signed sets
cites work: Intersecting families of permutations
cites work: Erdős-Ko-Rado from Kruskal-Katona
cites work: Matrices dont deux lignes quelconque coincident dans un nombre donne de positions communes
cites work: On the maximum number of permutations with given maximal or minimal distance
cites work: Erdös–Ko–Rado Theorem—22 Years Later
cites work: An Erdős-Ko-Rado theorem for the subcubes of a cube
cites work: A Group-Theoretic Setting for Some Intersecting Sperner Families
cites work: INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
cites work: Q4184835
cites work: Q3770569
cites work: The Erdös-Ko-Rado Theorem for Integer Sequences
cites work: The Erdős-Ko-Rado theorem for integer sequences
cites work: More on the Erdős-Ko-Rado theorem for integer sequences
cites work: SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
cites work: Graphs with the Erdős-Ko-Rado property
cites work: A simple proof of the Erdős-Chao Ko-Rado theorem
cites work: Extremal problems for finite sets and convex hulls---a survey
cites work: Intersection theorems for systems of finite sets
cites work: On a combinatorial conjecture of Erdös
cites work: Q5726070
cites work: An Erdős--Ko--Rado theorem for partial permutations
cites work: Stable sets of maximal size in Kneser-type graphs
cites work: Erdős-Ko-Rado-type theorems for colored sets
cites work: An ordered version of the Erdős-Ko-Rado theorem
cites work: Q4055666
cites work: An analogue of the Erdoes-Ko-Rado theorem for the Hamming schemes H(n,q)
cites work: The exact bound in the Erdős-Ko-Rado theorem
DOI: 10.1016/J.DISC.2008.09.039
description: scientific article; zbMATH DE number 5569077