Degree Ramsey Numbers of Closed Blowups of Trees

Electronic Journal Of Combinatorics

Paul Horn¹ 

关键词: Ramsey Theory;    Graph Theory;   

DOI  :  

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

来源: Electronic Journal Of Combinatorics

【 摘 要 】

The degree Ramsey number of a graph $G$, denoted $R_\Delta(G;s)$, is $\min\{\Delta(H)\colon\, H\stackrel{s}{\to} G\}$, where $H\stackrel{s}{\to} G$ means that every $s$-edge-coloring of $H$ contains a monochromatic copy of $G$.  The closed $k$-blowup of a

【 授权许可】

Others