Erdos-Ko-Rado Theorems of Labeled Sets

For k = （k1,...,kn） E Nn, 1 ≤ k1 ≤ ... ≤ kn, let Lkr be the family of labeled r-sets on k given by Lkr：= {{（a1,la1）,...,（ar,lar）} ： {a1,...,ar} [n],lai ∈ [kai],i = 1,...,r}. A family A of labeled r-sets is intersecting if any two sets in ~4 intersect. In this paper we give the sizes and structures o...

Full description

Saved in:
Bibliographic Details
Published inActa Mathematicae Applicatae Sinica Vol. 28; no. 1; pp. 127 - 130
Main Authors Geng, Xing-bo, Li, Yu-shuang
Format Journal Article
LanguageEnglish
Published Heildeberg Institute of Applied Mathematics, Chinese Academy of Sciences and Chinese Mathematical Society 2012
Subjects
Applications of Mathematics
Math Applications in Computer Science
Mathematical and Computational Physics
Mathematics
Mathematics and Statistics
Theoretical
北京时间
周恩来
定理
家庭
标记
瑞士
鄂尔多斯
雷达表
labeled set
05D05
intersecting family
Erdős-Ko-Rado theorem
Online AccessGet full text

Cover

More Information
Summary:For k = （k1,...,kn） E Nn, 1 ≤ k1 ≤ ... ≤ kn, let Lkr be the family of labeled r-sets on k given by Lkr：= {{（a1,la1）,...,（ar,lar）} ： {a1,...,ar} [n],lai ∈ [kai],i = 1,...,r}. A family A of labeled r-sets is intersecting if any two sets in ~4 intersect. In this paper we give the sizes and structures of intersecting families of labeled r-sets.
Bibliography:For k = （k1,...,kn） E Nn, 1 ≤ k1 ≤ ... ≤ kn, let Lkr be the family of labeled r-sets on k given by Lkr：= {{（a1,la1）,...,（ar,lar）} ： {a1,...,ar} [n],lai ∈ [kai],i = 1,...,r}. A family A of labeled r-sets is intersecting if any two sets in ~4 intersect. In this paper we give the sizes and structures of intersecting families of labeled r-sets.
11-2041/O1
ErdSs-Ko-Rado theorem, labeled set, intersecting family
ISSN:0168-9673
1618-3932
DOI:10.1007/s10255-012-0128-8