Online and size anti-Ramsey numbers

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 ARs(H) of H. This number in offline and online setting is investigated here.
Document type :
Journal articles
Complete list of metadatas

Cited literature [32 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01457849
Contributor : Kolja Knauer <>
Submitted on : Monday, February 6, 2017 - 3:51:20 PM
Last modification on : Saturday, August 24, 2019 - 1:17:00 AM
Long-term archiving on : Sunday, May 7, 2017 - 2:43:28 PM

File

online-size-06-09-2013.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

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

Share

Metrics

Record views

128

Files downloads

192