Date of Publication:2014-01-01 Hits:
First Author:Yu-shuang Li
Date of Publication:2014-01-01
Journal:Acta Mathematicae Applicatae Sinica
Affiliation of Author(s):数理与信息工程学院
Document Type:期刊
Volume:Vol.30
Issue:No.3
Page Number: 583-588
ISSN No.:0168-9673
Key Words:Erd?s-Ko-Rado;(EKR);theorem;intersecting;family;ladder;graph;05D05
Abstract:For a graph G and an integer r ≥ 1, G is r-EKR if no intersecting family of independent r-sets of G is larger than the largest star (a family of independent r-sets containing some fixed vertex in G), and G is strictly r-EKR if every extremal intersecting
Translation or Not:no