<html>
<head>
<meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1">
<style type="text/css" style="display:none"><!--P{margin-top:0;margin-bottom:0;} --></style>
</head>
<body dir="ltr" style="font-size:12pt;color:#000000;background-color:#FFFFFF;font-family:Calibri,Arial,Helvetica,sans-serif;">
<div dir="ltr" style="font-size:12pt; color:#000000; background-color:#FFFFFF; font-family:Calibri,Arial,Helvetica,sans-serif">
<span style="font-family:Arial,Helvetica,sans-serif; font-size:12pt"><font style="" color="black"><span dir="ltr" style="font-size:12pt; background-color:white">Dear all,<br>
<br>
On Tuesday 20 December Aysel Erey (University of Denver) will give a talk in the Bilkent Algebra seminar.<br>
The title of her talk is<br>
"</span></font></span><span style="font-family:Arial,Helvetica,sans-serif; font-size:12pt"><font style="" color="black"><span dir="ltr" style="background-color:white"><span dir="ltr" style=""><font style="" color="black"><span style="background-color:white"><span dir="ltr" style=""><font color="#000000">The
Chromatic Polynomial</font></span></span></font></span><span style="white-space:nowrap"><font size="2"><span style="font-size:10pt"></span></font></span>".<br>
<br>
Abstract:<br>
</span></font></span><span style="font-size:12pt">
<p><font style="font-family:Arial,Helvetica,sans-serif" size="3" color="black"><span dir="ltr" style="font-size:12pt; background-color:white"></span></font></p>
<font style="font-family:Arial,Helvetica,sans-serif" color="black"><span dir="ltr" style="background-color:white"><span dir="ltr" style=""><span style="background-color:white"></span></span></span></font></span><span style="font-size:12pt; font-family:Arial,Helvetica,sans-serif"><font style="" color="black"><span dir="ltr" style="background-color:white"><font style="" color="black"><span style="background-color:white"><span dir="ltr" style=""></span></span></font></span></font></span><span style="font-size:12pt; font-family:Arial,Helvetica,sans-serif"><font style="" color="black"><span dir="ltr" style="background-color:white"><font color="#000000">The
chromatic polynomial of a graph </font><font color="#008000">$G$</font><font color="#000000">, denoted by
</font><font color="#008000">$\pi(G,x)$</font><font color="#000000">, is the polynomial whose evaluations at positive integers
</font><font color="#008000">$x$</font><font color="#000000"> count the number of proper
</font><font color="#008000">$x$</font><font color="#000000">-colourings of </font>
<font color="#008000">$G$</font><font color="#000000">. This polynomial was introduced by Birkhoff in 1912 in an attempt to prove the famous Four Colour Theorem which stood as an unsolved problem for over a century. Since then, the chromatic polynomial has
been extensively studied and it has become an important object in the study of combinatorics. In this talk, I will discuss several problems on the chromatic polynomial and other related graph polynomials, and give an overview of some recent results.</font><br>
<br>
Time: 15.40,<br>
Place: Mathematics Department Seminar Room SA-141.<br>
<br>
Best regards,<br>
Anargyros Katsampekis</span></font></span> </div>
<p><span style="font-family: Arial,Helvetica,sans-serif;"></span><br>
</p>
</body>
</html>