On Unicyclic Ramsey (mK2, P₃)−Minimal Graphs

详细信息    查看全文

• 作者：Kristiana Wijaya ; ¹ ; ^{kristiana.w@students.itb.ac.id" class="auth_mail" title="E-mail the corresponding author} ; Edy Tri Baskoro ^{ebaskoro@math.itb.ac.id" class="auth_mail" title="E-mail the corresponding author} ; Hilda Assiyatun ^{hilda@math.itb.ac.id" class="auth_mail" title="E-mail the corresponding author} ; Djoko Suprijanto ^{djoko@math.itb.ac.id" class="auth_mail" title="E-mail the corresponding author}
• 关键词：Ramsey minimal graph ; matching ; path ; unicyclic.
• 刊名：Procedia Computer Science
• 出版年：2015
• 出版时间：2015
• 年：2015
• 卷：74
• 期：Complete
• 页码：10-14
• 全文大小：175 K

文摘

Ramsey minimal graph is one of growing topics in Ramsey theory. The search of Ramsey minimal graphs for a combination of graphs G and H is an interesting and difficult problem. In this paper, we study the properties of Ramsey minimal graphs for G = mK2 and H = Pn. In particular, we determine all unicyclic Ramsey minimal graphs for this combination.