Colored complete hypergraphs containing no rainbow Berge triangles
Colton Magnant
Theory and Applications of Graphs · 2019
doi:10.20429/tag.2019.060201 (opens in a new tab)
We email you when a new notice or a question about this paper appears.
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.
Abstract licence: CC BY
Reads
Read by people on this page
None yet.
Checked or read by AI through naulon
None yet.
A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.
Are you an author?
Is this your paper?
Claim it to add your note and be paid when agents cite it. Free.