The study of graph Ramsey numbers within restricted colorings, in particular forbidding a rainbow triangle, has recently been blossoming under the name Gallai-Ramsey numbers. In this work, we extend the main structural tool from rainbow triangle free colorings of complete graphs to rainbow Berge triangle free colorings of hypergraphs. In doing so, some other concepts and results are also translated from graphs to hypergraphs.
Creative Commons License
This work is licensed under a Creative Commons Attribution 4.0 License.
"Colored complete hypergraphs containing no rainbow Berge triangles,"
Theory and Applications of Graphs: Vol. 6
, Article 1.
Available at: https://digitalcommons.georgiasouthern.edu/tag/vol6/iss2/1