Department of Computer Science | Institute of Theoretical Computer Science | CADMO

Theory of Combinatorial Algorithms

Prof. Emo Welzl and Prof. Bernd Gärtner

Mittagsseminar (in cooperation with J. Lengler, A. Steger, and D. Steurer)

Mittagsseminar Talk Information

Date and Time: Thursday, January 04, 2007, 12:15 pm

Duration: This information is not available in the database

Location: OAT S15/S16/S17

Speaker: Johann A. Makowsky (Technion IIT, Haifa)

Why is the chromatic polynomial a polynomial

The full paper is available [here].

The number of k-vertex colorings of a graph is a polynomial in k, the chromatic polynomial. Many other graph invariants (Tutte polynomial, matching polynomial, interlace polynomial, cover polynomial) are also polynomials (possibly in several variables). We show that this is no accident. The talk presents the results in an elementary way, although the underlying theory stems from deep results in model theory.

In the analysis of the structure of totally categorical first order theories, B. Zilber (1981) showed that certain combinatorial counting functions play an important role. Those functions are invariants of the structures and are always polynomials in one or many variables, depending on the rank, respectively the independent dimension, of the theory in question.

The speaker introduced the notion of graph polynomials definable in Monadic Second Order Logic, and showed that the Tutte polynomial and its generalization, the matching polynomial, the cover polynomial and the various interlace polynomials fall into this category. This definition can be extended to allow definability in full second order, or even higher order Logic.

The purpose of this talk is to show that many graph polynomials and combinatorial counting functions of graph theory do occur as combinatorial counting functions of totally categorical theory. We also give a characterization of polynomials definable in Second Order Logic.

Joint work with B. Zilber.


Upcoming talks     |     All previous talks     |     Talks by speaker     |     Upcoming talks in iCal format (beta version!)

Previous talks by year:   2024  2023  2022  2021  2020  2019  2018  2017  2016  2015  2014  2013  2012  2011  2010  2009  2008  2007  2006  2005  2004  2003  2002  2001  2000  1999  1998  1997  1996  

Information for students and suggested topics for student talks


Automatic MiSe System Software Version 1.4803M   |   admin login