On the Ramsey numbers N(3,3,\dots ,3;2)

DOI10.1016/0012-365X(73)90125-8zbMath0258.05111OpenAlexW2082214688MaRDI QIDQ2559388

Fan R. K. Chung

Publication date: 1973

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(73)90125-8

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15)

Related Items (18)

New upper bound for multicolor Ramsey number of odd cycles ⋮ Lower bounds for Ramsey numbers and association schemes ⋮ A simple construction giving the two non-isomorphic triangle-free 3-colored \(K_{16}\)'s ⋮ An improved upper bound for Ramsey number \(R(3,3,3,3;2)\) ⋮ Quantitative theorems for regular systems of equations ⋮ The Schur degree of additive sets ⋮ Generalized Paley graphs and their complete subgraphs of orders three and four ⋮ Accelerating a continuous-time analog SAT solver using GPUs ⋮ Some results on Ramsey numbers using sumfree sets ⋮ On group partitions associated with lower bounds for symmetric Ramsey numbers ⋮ Unnamed Item ⋮ New lower bounds on the multicolor Ramsey numbers \(R_{r}(C_{2m})\) ⋮ Generalized fractional and circular total colorings of graphs ⋮ An adaptive upper bound on the Ramsey numbers $R(3,\dots,3)$ ⋮ Schur numbers and the Ramsey numbers N(3,3,\dots ,3;2) ⋮ Bounded \(VC\)-dimension implies the Schur-Erdős conjecture ⋮ Difference Ramsey numbers and Issai numbers ⋮ On Some Open Questions for Ramsey and Folkman Numbers

Cites Work

• Algebraic structure of chromatic graphs associated with the Ramsey number N(3,3,3; 2)
• On the maximal triangle-free edge-chromatic graphs in three colors
• Combinatorial Relations and Chromatic Graphs

This page was built for publication: On the Ramsey numbers N(3,3,\dots ,3;2)