On a Ramsey type theorem
On a Ramsey type theorem
复制标题
关于拉姆齐型定理
DOI：
10.1007/bf02018669
复制
发表时间：
1972
影响因子：
0.8
通讯作者：
A. Szemerédi
中科院分区：
文献类型：
--
作者：
P. Erdos;A. Szemerédi
致记忆 o [A. R~ NYI n-~(u)~ 是 ERD6S 和 RADO [1] 引入的众所周知的箭头符号。这意味着，如果我们用 k 种颜色对 n 个顶点 kn 的完整图的边进行着色，则总有一个 ku 的边都具有相同的颜色。 ERD6S、HAJNAL 和 RADO [2] 引入的符号 n-~[v]~ 意味着如果我们用 k 种颜色对 kn 的边进行着色，则总有一个 kv 的边仅包含 k--1 种颜色。在[1]和[2]中对无限基数的这些符号进行了广泛的研究。在本文中，我们仅考虑有限的 n。众所周知([3],[4]) [2 log 2] 2 n I: lognh2 (2)+ tl~-g 2/2"
To the memory o [A. R~ NYI n-~(u)~ is the well known arrow symbol introduced by ERD6S and RADO [1]. It means that if we color the edges of a complete graph of n vertices, kn, by k colors there is always a ku whose edges all have the same color. The symbol n-~[v]~ introduced by ERD6S, HAJNAL and RADO [2] means that if we color the edges of a kn by k colors there is always a kv whose edges contain only k--1 colors. These symbols were studied extensively for infinite cardinals in [1] and [2]. In this paper we will only consider finite n. It is well known ([3],[4]) that [2 log 2] 2 n I: lognh2 (2)+ tl~-g 2/2"