On graphs whose chromatic polynomials have no zeros in (1,2)

Combinatorics and Statistical Mechanics
31/01/2008 1h 0min

Listen "On graphs whose chromatic polynomials have no zeros in (1,2)"

Descargar episodio Ver en sitio original

Episode Synopsis

Dong, FM (Nanyang Technological )
Tuesday 22 January 2008, 14:00-15:00
Zeros of Graph Polynomials

More episodes of the podcast Combinatorics and Statistical Mechanics

A bijection between subgraphs and orientations based on the combinatorics of the Tutte polynomial 21/04/2008
A bijection for covered maps on orientable surfaces 30/04/2008
A birthday paradox for Markov chains, with an optimal bound for collision in the Pollard Rho algorithm for discrete logarithm 01/04/2008
A Grassmann algebra related to spanning forests 12/05/2008
A Markov chain for certain triple systems 27/03/2008
A new probability inequality and some optimal concentration results 27/03/2008
A rosetta stone: combinatorics, physics, probability 28/04/2008
A simple resummation method for cluster expansions 07/02/2008
Alexander-Conway polynomial, milnor numbers, and the Pfaffian matrix-tree theorem 25/04/2008
Algebraic structure of the q-Knizhnik-Zamolodchikov equation on a segment, partial sums and punctured plane partitions 01/05/2008
© 2003-2026 ZARZA | AHEAD OF OUR TIME
privacy policy
In God we trust In God we trust
PreSales Questions? Click Here
or call our toll-free line at +1-888-5002068 Miami, Florida, USA