期刊论文详细信息
Electronic Journal Of Combinatorics | |
Generalized Ramsey Numbers for Graphs with Three Disjoint Cycles Versus a Complete Graph | |
Shinya Fujita1  | |
关键词: independence number; Ramsey number; vertex-disjoint cycles; | |
DOI : | |
学科分类:离散数学和组合数学 | |
来源: Electronic Journal Of Combinatorics | |
【 摘 要 】
Let $\mathcal{F},\mathcal{G}$ be families of graphs. The generalized Ramsey number $r(\mathcal{F},\mathcal{G})$ denotes the smallest value of $n$ for which every red-blue coloring of $K_n$ yields a red $F\in\mathcal{F}$ or a blue $G\in \mathcal{G}$. Let $
【 授权许可】
Others
【 预 览 】
Files | Size | Format | View |
---|---|---|---|
RO201909023125269ZK.pdf | 263KB | download |