×

Lower bounds for multicolor Ramsey numbers. (English) Zbl 1456.05114

Summary: We give an exponential improvement to the lower bound on diagonal Ramsey numbers for any fixed number of colors greater than two.

MSC:

05C55 Generalized Ramsey theory
05D10 Ramsey theory
05C15 Coloring of graphs and hypergraphs
05A05 Permutations, words, matrices
PDFBibTeX XMLCite
Full Text: DOI arXiv Link

References:

[1] Alon, N.; Krivelevich, M., Constructive bounds for a Ramsey-type problem, Graphs Comb., 13, 217-225 (1997) · Zbl 0890.05050
[2] Conlon, D., A new upper bound for diagonal Ramsey numbers, Ann. Math., 170, 941-960 (2009) · Zbl 1188.05087
[3] Erdős, P., Some remarks on the theory of graphs, Bull. Am. Math. Soc., 53, 292-294 (1947) · Zbl 0032.19203
[4] Erdős, P.; Szekeres, G., A combinatorial problem in geometry, Compos. Math., 2, 463-470 (1935) · Zbl 0012.27010
[5] Lefmann, H., A note on Ramsey numbers, Studia Sci. Math. Hung., 22, 445-446 (1987) · Zbl 0561.05003
[6] Pudlák, P.; Rödl, V.; Savický, P., Graph complexity, Acta Inform., 25, 515-535 (1988) · Zbl 0681.68070
[7] Sah, A., Diagonal Ramsey via effective quasirandomness, preprint available at · Zbl 1512.05389
[8] Spencer, J., Ramsey’s theorem — a new lower bound, J. Comb. Theory, Ser. A, 18, 108-115 (1975) · Zbl 0296.05003
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.