Abstract
Gallai-Ramsey numbers often consider edge-colorings of complete graphs in which there are no rainbow triangles. Within such colored complete graphs, the goal is to look for specified monochromatic subgraphs. We consider an “off diagonal” case of this concept by looking for either a monochromatic $$K_{3}$$ in one of some set of colors or a monochromatic $$C_{4}$$ in one of some other set of colors.
Full Text
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call