Colored complete hypergraphs containing no rainbow Berge triangles

Authors

Colton Magnant, UPS of America, Inc.Follow

Abstract

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.

Recommended Citation

Magnant, Colton (2019) "Colored complete hypergraphs containing no rainbow Berge triangles," Theory and Applications of Graphs: Vol. 6: Iss. 2, Article 1.
DOI: 10.20429/tag.2019.060201
Available at: https://digitalcommons.georgiasouthern.edu/tag/vol6/iss2/1