搜索结果: 1-2 共查到“组合数学 All Colors”相关记录2条 . 查询时间(0.044 秒)
A recent question in generalized Ramsey theory is that for fixed positive integers $s\leq t$, at least how many vertices can be covered by the vertices of no more than $s$ monochromatic members of the...
We prove that every claw-free graph $G$ that doesn't contain a clique on $\Delta(G) \geq 9$ vertices can be $\Delta(G) - 1$ colored.