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

DOI10.1016/0012-365X(71)90010-0zbMATH Open0218.05057OpenAlexW2030519801WikidataQ128089368 ScholiaQ128089368MaRDI QIDQ2546512FDOQ2546512

Authors: 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

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

Cites Work

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

Cited In (5)

• Group Ramsey theory
• 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)

This page was built for publication: Algebraic structure of chromatic graphs associated with the Ramsey number N(3,3,3; 2)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2546512)