Online and size anti-Ramsey numbers

Maria Axenovich, Kolja Knauer, Judith Stumpp, Torsten Ueckerdt
2014 Journal of Combinatorics  
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 graph H is the size anti-Ramsey number ARs(H) of H. This number in offline and online setting is investigated here.
doi:10.4310/joc.2014.v5.n1.a4 fatcat:e6lbgmq4cjbivmvcs5yn3yqcka