Announcement for Seminar on Combinatorial and Discrete
Mathematics
Department of Mathematics
West Virginia University
for
Apr 28, Wednesday, 3:30
in 315 Armstrong Hall
Professor Antony Hilton
Reading University, Great Britain
Some aspects of edge list colouring
The talk will be suitable for a general audience.
Students are strongly encouraged to participate.
Abstract
Recently Borodin, Kostochka and Woodall improved Galvin's
seminal result that the edge choice number of a bipartite multigraph is
the maximum degree by showing that if each edge e=uv of G has a list of
length max{d(u),d(v)} then G is list colourable. Also recently, Hilton,
Slivnik and Stirling used Galvin's result to show that, for any multigraph
G, if s is even, the s-improper edge choice number of G is not more than
1/s times the maximum degree plus 1, and that if all the edges have a list
of at least this size then G has an s-improper list colouring that is
edge-bounded (meaning that no multiple edge has too many edges of any
colour). We show how these result can be strengthened in various ways.
We also show how these results can be used to draw up a school
timetable nicely when some teachers are part time, and similarly, some
classes are not always available.
The information on the future (and past) Colloquia can be also found on web at the
address:
http://www.math.wvu.edu/homepages/kcies/colloquium.html