Upper bounds for ramsey numbers R(3, 3, ?, 3) and Schur numbers
From MaRDI portal
Publication:4364803
DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1097-0118(199711)26:3<119::AID-JGT1>3.0.CO;2-U" /><119::AID-JGT1>3.0.CO;2-U 10.1002/(SICI)1097-0118(199711)26:3<119::AID-JGT1>3.0.CO;2-UzbMath0882.05095OpenAlexW2034706096MaRDI QIDQ4364803
Publication date: 18 November 1997
Full work available at URL: https://doi.org/10.1002/(sici)1097-0118(199711)26:3<119::aid-jgt1>3.0.co;2-u
Related Items (11)
New upper bound for multicolor Ramsey number of odd cycles ⋮ On the minimum degree of minimal Ramsey graphs for multiple colours ⋮ Poonen's conjecture and Ramsey numbers ⋮ The \(k\)-strong induced arboricity of a graph ⋮ Regular languages viewed from a graph-theoretic perspective ⋮ On the existence of \(k\)-partite or \(K_p\)-free total domination edge-critical graphs ⋮ Gallai-Ramsey numbers for multiple triangles ⋮ On the $n$-color Rado number for the equation $x_{1}+x_{2}+ \dots +x_{k}+c =x_{k+1}$ ⋮ An adaptive upper bound on the Ramsey numbers $R(3,\dots,3)$ ⋮ The multi-color Ramsey number of an odd cycle ⋮ On the multi-colored Ramsey numbers of cycles
This page was built for publication: Upper bounds for ramsey numbers R(3, 3, ?, 3) and Schur numbers
