The Ramsey number N(3,3,3,3;2)

DOI10.1016/0012-365X(73)90174-XzbMath0255.05107OpenAlexW1965721033MaRDI QIDQ2558227

Earl Glen jun. Whitehead

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)90174-x

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Torsion groups, primary groups and generalized primary groups (20K10)

Related Items

Sum-Free Sets of Integers, An improved upper bound for Ramsey number \(R(3,3,3,3;2)\), On group partitions associated with lower bounds for symmetric Ramsey numbers, Difference sets and sum-free sets in groups of order 16, On the $n$-color Rado number for the equation $x_{1}+x_{2}+ \dots +x_{k}+c =x_{k+1}$, Generalised Ramsey numbers for small graphs, Group Ramsey theory, On Some Open Questions for Ramsey and Folkman Numbers

Cites Work

• Unnamed Item
• 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