[Discrete-math-seminar] Discrete Appl. Math. Seminar TODAY 11/2, 12:50pm E1 119

Robert Ellis rellis at math.iit.edu
Mon Nov 2 10:39:46 CST 2009


Please join us for the seminar today at 12:50pm in E1 119.

===========================================

Michael Pelsmajer

Department of Applied Mathematics
Illinois Institute of Technology

Treewidth is, in a way, a measure of how closely a graph resembles a tree.
 It is important for both applied and theoretical reasons (e.g., dynamic
programming, fixed-parameter tractability, graph minors project).

In this talk we introduce treewidth and describe two research questions that
should be accessible to students.  One concerns a graph coloring variant
called "equitable list coloring", and the other generalizes independent sets
and induced matchings.

2 November, 2009  E1 119  12:50 pm

-- 
E1 105C, IL Inst. Tech.
Chicago, IL 60616
(312) 567-5336 --- rellis at math.iit.edu
http://math.iit.edu/~rellis/
-------------- next part --------------
An HTML attachment was scrubbed...
URL: http://math.iit.edu/pipermail/discrete-math-seminar/attachments/20091102/92725e2f/attachment.htm 


More information about the Discrete-math-seminar mailing list