Speaker:
Xuding Zhu(Zhejiang Normal University)
Host:
Shanghai Center For Mathematical Science
Time:
- 14:00 – 16:00 (Time in Beijing)
- September 13, 2021 (Monday)
Venue:
Zoom meeting ID: 818 0564 1942 Password: 121323
Link: https://zoom.com.cn/j/81805641942
Abstract:
The well-known 1-2-3 conjecture asserts that any graph
with no isolated edges has an edge-weighting vertex colouring using
weights 1,2 and 3. The list version of this conjecture asserts that if each
edge 𝑒 is given a list L(𝑒)” of 3 real numbers as permissible weights,
then there is an edge-weighting vertex colouring 𝑓 using permissible
weights for each edge 𝑒.
In this talk, I will give a detailed sketch of the proof that if each
edge 𝑒 is given a list 𝐿(𝑒)” of 5 permissible weights, then there is an
edge-weighting vertex colouring 𝑓 using permissible weights from
𝐿(𝑒)” for each edge 𝑒.