In preparation

Continuously updated.
Last update: 17. March 2011

Lectures

  1. Lecture 1 (March, 6), slides, posted March 17.

    Abstract: Organizational matters, purpose of the course.
    Graph invariants,
    Graph polynomials: a tour through a bizarre landscape I. The Chromatic Polynomial and the Characteristic Polynomial.


  2. Lecture 2 (March 13), slides posted on March 18.

    Abstract: Graph polynomials: a tour through a bizarre landscape II. The Matching Polynomial and the Tutte Polynomial.
    Graph invariants induced by other graph invariants.

    Project proposal

    Prepare slides with a proof of the Farrell-Whitehead Theorem:
    E.J. FARRELL and EARL GLEN WHITEHEAD, JR.
    CONNECTIONS BETWEEN THE MATCHING AND CHROMATIC POLYNOMIALS
    Internat. J. Math. & Math. Sci. VOL. 15 NO. 4 (1992) 757-766 pdf-file
  3. Lecture 3 (March, 23), slides (unrevised)

    Abstract: Inventing graph polynomials: Generating functions vs generalized colorings.
    Comparing graph polynomials.


  4. Lecture 4 (March, 27), slides (unrevised)

    Abstract: Complexity of the chromatic polynomial.
    More on comparing graph polynomials.


  5. Lecture 5 (April, 3),

    Abstract:


  6. Lecture 6 (April, 10), slides

    Abstract:


    PESSAH VACATION


  7. Lecture 7 (May, 1), slides, based on Ilia Averbouch, 2005

    Abstract: The Characteristic and the Matching polynomial. (Part I)


  8. Lecture 8 (May, 8),

    Abstract: We discussed the projects and the universal vertex elimination polynomial of Averbouch, Makowsky and Tittmann, slides


  9. Lecture 9 (May, 15), slides, based on Ilia Averbouch, 2005

    Abstract: The Characteristic and the Matching polynomial. (Part II)


  10. Lecture 10 (May, 22), slides

    Abstract:


  11. Lecture 11 (May, 29), slides

    Abstract:


  12. Lecture 12 (June, 5), slides

    Abstract:


  13. Lecture 13 (June, 12), slides

    Abstract:


  14. Lecture 14 (June, 19), slides

    Abstract: