Return to Colloquia & Seminar listing
Trivariate Chromatic Polynomials for Hyperpgraphs, and Hyperedge Elimination
Student-Run Discrete Math Seminar| Speaker: | Jacob White, MSRI |
| Location: | 1147 MSB |
| Start time: | Fri, Feb 25 2011, 11:00AM |
We review some history of polynomial invariants of graphs. Then we introduce two new polynomials for hypergraphs: the trivariate chromatic polynomial, and the hyperedge elimination polynomial. These two polynomials are substitutions of each other, and certain evaluations of these polynomials enumerate numerous combinatorial objects, such as hyperedge coverings, matchings, transversals, etc. No prior knowledge of hypergraphs will be assumed.