Set-Coloring Ramsey Numbers via Codes
- 15 April 2024
- journal article
- research article
- Published byย Akademiai Kiado Zrt.ย inย Studia Scientiarum Mathematicarum Hungarica
- Vol.ย 61 ย (1) , 1-15
Abstract
For positive integers ๐, ๐, ๐ with ๐ > ๐ , the set-coloring Ramsey number ๐ (๐; ๐, ๐ ) is the minimum ๐ such that if every edge of the complete graph ๐พKeywords
All Related Versions
This publication has 17 references indexed in Scilit:
- Diagonal Ramsey via effective quasirandomnessDuke Mathematical Journal, 2023
- The (tโ1) $(t-1)$โchromatic Ramsey number for pathsJournal of Graph Theory, 2022
- An improved lower bound for multicolor Ramsey numbers and a problem of ErdลsJournal of Combinatorial Theory, Series A, 2022
- An improved lower bound on multicolor Ramsey numbersProceedings of the American Mathematical Society, 2021
- Lower bounds for multicolor Ramsey numbersAdvances in Mathematics, 2021
- Monochromatic tree covers and Ramsey numbers for set-coloured graphsDiscrete Mathematics, 2018
- The ErdลsโRothschild problem on edge-colourings with forbidden monochromatic cliquesMathematical Proceedings of the Cambridge Philosophical Society, 2017
- Set-coloring of Edges and Multigraph Ramsey NumbersGraphs and Combinatorics, 2009
- A Ramseyโtype problem and the Turรกn numbers*Journal of Graph Theory, 2002
- A Comparison of Signalling AlphabetsBell System Technical Journal, 1952