When: Sunday, October 25, 10am
Where: Schreiber 309
Speaker: Dan Hefetz, Hebrew University
Title: On degree anti-Ramsey numbers
The degree anti-Ramsey number AR_d(H) of a graph H is the smallest
integer k for which there exists a graph G with maximum degree
at most k such that any proper edge colouring of G yields a rainbow
copy of H. In this talk I will present a general upper bound on
degree anti-Ramsey numbers, determine the precise value of the degree
anti-Ramsey number of any forest, and prove an upper bound on
the degree anti-Ramsey number of cycles, which is best possible up to
a multiplicative factor of 2.
Based on joint work with Shoni Gilboa.