Rainbow Generalizations of Ramsey Theory: A Survey

@article{Fujita2010RainbowGO,
  title={Rainbow Generalizations of Ramsey Theory: A Survey},
  author={Shinya Fujita and Colton Magnant and Kenta Ozeki},
  journal={Graphs and Combinatorics},
  year={2010},
  volume={26},
  pages={1-30}
}
In this work, we collect Ramsey-type results concerning rainbow edge colorings of graphs. 
Maximum number of colors: C-coloring and related problems
We discuss problems and results on the maximum number of colors in combinatorial structures under the assumption that no totally multicolored sets of a specified type occur.
Anti-Ramsey numbers for paths
We determine the exactly anti-Ramsey number for paths. This confirms a conjecture posed by Erdős, Simonovits and Sós in 1970s.
Rainbow Generalizations of Ramsey Theory - A Dynamic Survey
In this work, we collect Ramsey-type results concerning rainbow edge colorings of graphs. Revision History • Revision 3: March, 2015. • Revision 2: October, 2014. • Revision 1: July, 2011. •
Ramsey numbers in rainbow triangle free colorings
TLDR
This number is found precisely for a C4 and all trees on at most 6 vertices and bounds are provided for general paths.
Anti-Ramsey Number of Edge-Disjoint Rainbow Spanning Trees
TLDR
The anti-Ramsey number of edge-disjoint rainbow spanning trees, denoted by r(n,t)$, is defined as t/(n, t) + 1, where n is the number of trees and t is the total number of particles in the graph.
Online and size anti-Ramsey numbers
A graph is properly edge-colored if no two adjacent edges have the same color. The smallest number of edges in a graph any of whose proper edge colorings contains a totally multicolored copy of a
Characterizations of edge-colorings of complete graphs that forbid certain rainbow subgraphs
In this work, we characterize all edge-colorings of complete graphs without rainbow K1,3 and those without rainbow P + 4 , where P + 4 is the graph consisting of P4 with one extra edge incident with
Rainbow number of matchings in Halin graphs
The rainbow number rb(G,H) for the graph H in G is defined to be the minimum integer k such that any k-edge-coloring of G contains a rainbow H. As one of the most important structures in graphs, the
Title Recent topics on Monochromatic Structures in Edge-colored Graphs (Designs, Codes, Graphs and Related Areas)
We will review some recent results on the existence of monochromatic subgraphs with certain properties in edge-colored graphs.
Structure of Colored Complete Graphs Free of Proper Cycles
TLDR
A global structure is established by bounding the number of colors that can induce a spanning and connected subgraph in edge colorings of complete graphs which contain no properly edge colored cycle Cm as a subgraph.
...
...

References

SHOWING 1-10 OF 147 REFERENCES
Rainbow Ramsey Theory
This paper presents an overview of the current state in research directions in the rainbow Ramsey theory. We list results, problems, and conjectures related to existence of rainbow arithmetic
NOTE New Upper Bounds for a Canonical Ramsey Problem
TLDR
It is proved that if, then as , then as .
A note on perfect graphs
Let the lines of a complete graph be 3-colored so that no triangle gets 3 different colors. If two of these colors form perfect graphs then so does the third.
Gallai Multigraphs
A complete edge-colored graph or multigraph is called Gallai if it lacks rainbow triangles. We give a construction of all finite Gallai multigraphs.
Ramsey numbers in rainbow triangle free colorings
TLDR
This number is found precisely for a C4 and all trees on at most 6 vertices and bounds are provided for general paths.
Multicoloured Hamilton Cycles
TLDR
The edges of the complete graph $K_n$ are coloured so that no colour appears more than $\lceil cn\rceil$ times, where $c$ is the number of squares in the graph.
Edge colorings of complete graphs without tricolored triangles
We show some consequences of results of Gallai concerning edge colorings of complete graphs that contain no tricolored triangles. We prove two conjectures of Bialostocki and Voxman about the
Note – Edge-Coloring Cliques with Three Colors on All 4-Cliques
TLDR
is constructed such that every copy of has at least three colors on its edges, and improves upon the previous probabilistic bound of due to Erdős and Gyárfás.
On a Generalized Anti-Ramsey Problem
TLDR
The largest such that all -colorings of have at most O(n) colors is determined and is determined asymptotically when it is of order equal to .
...
...