[Female-math-faculty] WIM Fall Speaker - Maria Chudnovsky
fesdunbar at math.uwaterloo.ca
Thu Nov 24 14:57:38 EST 2011
UW Women in Math and C&O Tutte Seminars are proud to present a Guest Lecture
Friday December 2 3:30pm
All female undergrads, grads and faculty are invited to a
Meet and Greet with Maria
12:00-1:30pm in MC 5136
Lunch will be served.
Please RSVP to wim at uwaterloo.ca if you would like to join us.
TITLE: Forcing large transitive subtournaments
ABSTRACT: The Erdos Hajnal Conjecture states roughly that a graph with
some induced subgraph excluded has a large clique or a large stable set. A
similar statement can be formulated for tournaments (a tournament is an
orientation of a complete graph), replacing cliques and stable sets by
transitive subtournaments; and the two conjectures turn out to be
equivalent. This talk will survey a number of recent results related to
the latter conjecture. In particular, we will discuss a new infinite class
of tournaments excluding which forces large transitive subtournaments; to
the best of our knowledge this is the first such class not obtained by the
so-called substitution operation.
BIO: Maria Chudnovsky received her B.A. and M.Sc. from the Technion, and a
PhD from Princeton University in 2003. Currently she is an associate
professor at Columbia University. Before that she was a Veblen Research
Instructor at Princeton University and the IAS, and then an assistant
professor at Princeton. Until April 2008 she was a Clay Mathematics
Institute research fellow. Her research interests are in graph theory and
combinatorial optimization. In 2009 she was awarded the Fulkerson Prize,
as part of a team of researchers, for their proof of the Strong Perfect
Graph Theorem, a forty year old conjecture, that had been a well known
open problem in both graph theory and combinatorial optimization.
-------------- next part --------------
A non-text attachment was scrubbed...
Name: maria poster 2.pdf
Size: 74139 bytes
Desc: not available
More information about the Female-math-faculty