QLunch:Bergfinnur Durhuus

Speaker: Bergfinnur Durhuus from QMATH

Title: On Whitney’s theorem for graphs and hypergraphs.

Abstract: I will describe Whitney’s theorem (from 1932) and a generalization to hypergraphs. A proof based on recursion relations will be discussed together with an application to chromatic polynomials for complete hypergraphs. (Joint work with Angelo Lucia.)