Friday, July 23, 2010 3:30 pm
-
4:30 pm
EDT (GMT -04:00)
Edge colouring multigraphs
| Speaker: | Penny Haxell |
|---|---|
| Affiliation: | University of Waterloo |
| Room: | Mathematics & Computer Building (MC) 5158 |
Abstract:
We
highlight
a
technique
for
studying
edge
colourings
of
multigraphs,
due
to
Tashkinov.
This
method
is
a
sophisticated
generalisation
of
the
method
of
alternating
paths,
and
builds
upon
earlier
work
by
Kierstead
and
Goldberg.
In
particular
we
show
how
to
apply
it
to
a
number
of
edge
colouring
problems,
including
the
question
of
whether
the
class
of
multigraphs
that
attain
equality
in
Vizing's
classical
bound
can
be
characterised.
This
talk
represents
joint
work
with
Jessica
McDonald.