Online and size anti-Ramsey numbers

Maria Axenovich (1) , Kolja Knauer (2, 3) , Judith Stumpp (1) , Torsten Ueckerdt (1)

1 KIT - Karlsruhe Institute of Technology
2 LIF - Laboratoire d'informatique Fondamentale de Marseille
3 ACRO - Algorithmique, Combinatoire et Recherche Opérationnelle

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.

Mots clés: Coloring; anti-Ramsey; rainbow; totally multicolored; proper coloring; online; Ramsey; size-Ramsey

Domaines: Informatique [cs]

Maria Axenovich, Kolja Knauer, Judith Stumpp, Torsten Ueckerdt. Online and size anti-Ramsey numbers. Journal of Combinatorics, 2014, 5, pp.87 - 114. ⟨10.4310/JOC.2014.v5.n1.a4⟩. ⟨hal-01457849⟩