Erdos-Ko-Rado Theorem for Ladder Graphs

在线阅读 下载PDF 导出详情
摘要 ForagraphGandanintegerr≥1,Gisr-EKRifnointersectingfamilyofindependentr-setsofGislargerthanthelargeststar(afamilyofindependentr-setscontainingsomefixedvertexinG),andGisstrictlyr-EKRifeveryextremalintersectingfamilyofindependentr-setsisastar.Recently,HurlbertandKamatgaveapreliminaryresultaboutEKRpropertyofladdergraphs.Theyshowedthataladdergraphwithnrungsis3-EKRforalln≥3.Thepresentpaperprovesthatthisgraphisr-EKRforall1≤r≤n,andstrictlyr-EKRexceptforr=n-1.
机构地区 不详
出版日期 2014年03月13日(中国期刊网平台首次上网日期,不代表论文的发表时间)
  • 相关文献