期刊论文详细信息
Electronic Journal Of Combinatorics | |
Ramsey Numbers of Trees Versus Odd Cycles | |
Matthew Brennan1  | |
关键词: Ramsey number; Trees; Odd cycles; | |
DOI : | |
学科分类:离散数学和组合数学 | |
来源: Electronic Journal Of Combinatorics | |
【 摘 要 】
Burr, Erdős, Faudree, Rousseau and Schelp initiated the study of Ramsey numbers of trees versus odd cycles, proving that $R(T_n, C_m) = 2n - 1$ for all odd $m \ge 3$ and $n \ge 756m^{10}$, where $T_n$ is a tree with $n$ vertices and $C_m$ is an odd cycle
【 授权许可】
Others
【 预 览 】
Files | Size | Format | View |
---|---|---|---|
RO201909024685737ZK.pdf | 254KB | download |