Bipartite Ramsey Numbers for Graphs of Small Bandwidth

Electronic Journal Of Combinatorics

Lili Shen¹ 

关键词: Bipartite Ramsey number;    Balanced $(\beta;    \Delta)$-graph;    Regularity lemma;   

DOI  :  

学科分类：离散数学和组合数学

来源: Electronic Journal Of Combinatorics

【 摘 要 】

A graph $H=(W,E_H)$ is said to have bandwidth at most $b$ if there exists a labeling of $W$ as $w_1,w_2,\dots,w_n$ such that $|i-j|\leq b$ for every edge $w_iw_j\in E_H$, and a bipartite balanced $(\beta,\Delta)$-graph $H$ is a bipartite graph with bandwi

【 授权许可】

Others