A lower bound for set-colouring Ramsey numbers
EUROCOMB’23
50–56
N. Alon and V. Rödl, Sharp bounds for some multicolor Ramsey numbers, Combinatorica, 25 (2005), 125-141.
https://doi.org/10.1007/s00493-005-0011-9
D. Conlon, J. Fox, X. He, D. Mubayi, A. Suk and J. Verstraëte, Set-coloring Ramsey numbers via codes, arXiv:2206.11371
D. Conlon, J. Fox, X. He, D. Mubayi, A. Suk and J. Verstraëte, Hypergraph Ramsey numbers of cliques versus stars, Random Structures Algorithms, to appear, arXiv:2210.03545
D. Conlon, J. Fox and B. Sudakov, Recent developments in graph Ramsey theory, Surveys in Combinatorics, 424 (2015), 49-118.
https://doi.org/10.1017/CBO9781316106853.003
P. Erdős, A. Hajnal and R. Rado, Partition relations for cardinal numbers, Acta Math. Acad. Sci., 16 (1965), 93-196.
https://doi.org/10.1007/BF01886396
P. Erdős and A. Szemerédi, On a Ramsey type theorem, Period Math. Acad., 2 (1972), 295-299.
https://doi.org/10.1007/BF02018669
X. He and Y. Wigderson, Multicolor Ramsey numbers via pseudorandom graphs, Electron. J. Combin., 27 (2020), Article No. P1.32.
https://doi.org/10.37236/9071
D. Mubayi and J. Verstraëte, A note on pseudorandom Ramsey graphs, J. Eur. Math. Soc., to appear, arXiv:1909.01461.
W. Sawin, An improved lower bound for multicolor Ramsey numbers and a problem of Erdős, J. Combin. Theory Ser. A, 188 (2022), Paper No. 105579, 11 pp.
https://doi.org/10.1016/j.jcta.2021.105579
Y. Wigderson, An improved lower bound on multicolor Ramsey numbers, Proc. Amer. Math. Soc., 149 (2021), 2371-2374.
https://doi.org/10.1090/proc/15447
This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.
Copyright © 2023 Lucas Aragão, Maurício Collares, João Pedro Marciano, Taísa Martins, Robert Morris