Algebraic structure of chromatic graphs associated with the Ramsey number N(3,3,3; 2)

DOI10.1016/0012-365X(71)90010-0zbMath0218.05057OpenAlexW2030519801WikidataQ128089368 ScholiaQ128089368MaRDI QIDQ2546512

Earl Glen jun. Whitehead

Publication date: 1971

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

Full work available at URL: https://doi.org/10.1016/0012-365x(71)90010-0

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Coloring of graphs and hypergraphs (05C15)

Related Items

Difference sets and sum-free sets in groups of order 16, An adaptive upper bound on the Ramsey numbers $R(3,\dots,3)$, The Ramsey number N(3,3,3,3;2), On the Ramsey numbers N(3,3,\dots ,3;2), Group Ramsey theory

Cites Work

• On the maximal triangle-free edge-chromatic graphs in three colors
• Combinatorial Relations and Chromatic Graphs