When is an Almost Monochromatic K4Guaranteed?

Autor:	ALEXANDR KOSTOCHKA, DHRUV MUBAYI
Předmět:	MATHEMATICAL constants RAMSEY numbers MATHEMATICAL analysis NUMERICAL analysis COMBINATORICS PROBABILITY theory
Zdroj:	Combinatorics, Probability & Computing; Nov2008, Vol. 17 Issue 6, p823-830, 8p
Abstrakt:	Suppose that n> (log k)ck, where cis a fixed positive constant. We prove that, no matter how the edges of Knare coloured with kcolours, there is a copy of K4whose edges receive at most two colours. This improves the previous best bound of kc?k, where c? is a fixed positive constant, which follows from results on classical Ramsey numbers. [ABSTRACT FROM AUTHOR]
Databáze:	Complementary Index
Externí odkaz:	Zobrazit plný text záznamu