Online and size anti-Ramsey numbers
Combinatorics
2013-11-05 v1
Abstract
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 AR_s(H) of H. This number in offline and online setting is investigated here.
Keywords
Cite
@article{arxiv.1311.0539,
title = {Online and size anti-Ramsey numbers},
author = {Maria Axenovich and Kolja Knauer and Judith Stumpp and Torsten Ueckerdt},
journal= {arXiv preprint arXiv:1311.0539},
year = {2013}
}
Comments
19 pages, 4 figures