For graphs G and H we write G ind under right arrow H if every 2-edge colouring of G yields an induced monochromatic copy of H. The induced Ramsey number for H is defined as r(ind)(H) = min{V/(G): G ind under right arrow H}. We show that for every d greater than or equal to 1 there exists an absolute constant C-d such that r(ind)(H-n,H- d) less than or equal to n(cd) for every graph H-n,H- d with n vertices and the maximum degree at most d. This confirms a conjecture suggested by W.T. Trotter. (C) 1996 Academic Press, Inc. [References: 13]
展开▼
机译：对于图形G和H，如果G的每个2边色产生H的感应单色副本，我们在右箭头H下写G ind。H的感应Ramsey数定义为r（ind）（H）= min { V /（G）：右箭头H}下的G ind。我们表明，对于每一个大于或等于1的d，都存在一个绝对常数Cd，使得对于每个具有n的图Hn，H- d，r（ind）（Hn，H- d）小于或等于n（cd）。顶点和最大度d。这证实了W.T. Trotter提出的猜想。 （C）1996 Academic Press，Inc. [参考：13]
展开▼
