Colored complete hypergraphs containing no rainbow Berge triangles

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

THE ELECTRONIC JOURNAL OF COMBINATORICS (2014), DS1.14 References

and Computing 11. The results of 143 references depend on computer algorithms. The references are ordered alphabetically by the last name of the first author, and where multiple papers have the same first author they are ordered by the last name of the second author, etc. We preferred that all work by the same author be in consecutive positions. Unfortunately, this causes that some of the abbreviations are not in alphabetical order. For example, [BaRT] is earlier on the list than [BaLS]. We also wish to explain a possible confusion with respect to the order of parts and spelling of Chinese names. We put them without any abbreviations, often with the last name written first as is customary in original. Sometimes this is different from the citations in other sources. One can obtain all variations of writing any specific name by consulting the authors database of Mathematical Reviews a