Graph polynomials serve as robust algebraic encodings of the intricate combinatorial properties inherent to graphs. At the heart of this discipline lies the Tutte polynomial, an invariant that not ...

UC Santa Barbara computer scientist Daniel Lokshtanov is advancing fundamental understanding of computational efficiency through groundbreaking research on quasi-polynomial time algorithms, supported ...

The quantum Bruhat graph, which is an extension of the graph formed by covering relations in the Bruhat order, is naturally related to the quantum cohomology ring of G/B. We enhance a result of Fulton ...

We derive a formula for the chromatic polynomial of a chordal or a triangulated graph in terms of its maximal cliques. As a corollary we obtain a way to write down an explicit formula for the ...