关于C₄对扫帚图和双星图的二部Ramsey数  

Bipartite Ramsey Numbers for C4 versus Brooms and Bistars

作　　者：郑锡华 

机构地区：[1]浙江师范大学,数学科学学院,浙江 金华

出　　处：《应用数学进展》2024年第11期5045-5052,共8页Advances in Applied Mathematics

摘　　要：给定简单二部图G1,G2,二部Ramsey数BR(G1G2)表示最小的正整数N,使得对完全二部图KN,N的任意生成子图G,要么G包含G1,要么G包含G2,其中G为G关于KN,N的补图。本文主要研究了C4对扫帚图Bk,m以及双星图B(n,m)这两类特殊类型的树的二部Ramsey数。For simple bipartite graphs G1, G2, the bipartite Ramsey number BR(G1, G2) is the smallest integer N such that given any spanning subgraph G of the complete bipartite graph KN,N , either G contains a copy of G1, or there exists a copy of G2 in G, whereG is the complement of G relative to KN,N . This article mainly studies the bipartite Ramsey numbers for C4 versus two special types of trees, broom and bistar.

关 键 词：扫帚图 双星图 二部Ramsey数 

分 类 号：O15[理学—数学]