Notes on the Ramsey number N(3,3,3,3)

DOI10.1016/0097-3165(74)90060-0zbMath0277.05113OpenAlexW2020949184MaRDI QIDQ1393407

Jon Folkman

Publication date: 1974

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0097-3165(74)90060-0

Mathematics Subject Classification ID

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

Related Items (3)

An improved upper bound for Ramsey number \(R(3,3,3,3;2)\) ⋮ On Some Open Questions for Ramsey and Folkman Numbers ⋮ Bounding the vertex cover number of a hypergraph

Cites Work

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

This page was built for publication: Notes on the Ramsey number N(3,3,3,3)