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.
Cite
CITATION STYLE
APA
Axenovich, M., Knauer, K., Stumpp, J., & Ueckerdt, T. (2014). Online and size anti-Ramsey numbers. Journal of Combinatorics, 5(1), 87–114. https://doi.org/10.4310/joc.2014.v5.n1.a4
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free