Description
Bounding chromatic roots of series parallel graphs in terms of maxmaxflow
2008-07-0101:04:36
Zero-free regions for multivariate Tutte polynomials
2008-06-1001:11:30
Trees versus connected graphs II
2008-05-2752:59
Random randomly coloured graphs
2008-05-1357:28
Trees versus connected graphs I
2008-05-1359:17
Can we solve it? Some numerical tests revealing analytic structure.
2008-05-1301:15:17
Large deviations and quantum gravity
2008-05-1301:32:04
The clustering coefficient of a scale-free random graph
2008-05-1257:24
A Grassmann algebra related to spanning forests
2008-05-1201:28:02
Theory of electric networks: the two-point resistance and impedance
2008-05-0953:16
Counting lattice paths with the kernel method
2008-05-0901:09:00
Prudent and quasi-prudent self-avoiding walks and polygons
2008-05-0859:16
Boundary partitions in trees and dimers
2008-05-0801:05:21
Dimer partition functions on surface graphs of higher genus
2008-05-0858:57
Exact enumeration of plane partitions and rhombus tilings
2008-05-0701:06:18
Dimer packings with gaps and electrostatics: boundary interactions
2008-05-0701:09:00
The bead model
2008-05-0753:27
Alternative tableaux, permutations and partially asymmetric exclusion process
2008-05-0701:10:18
Conformal invariance and universality in the 2D lsing model
2008-05-0601:09:28
Entanglement in the XXZ chain
2008-05-0601:02:23
0.5x
0.8x
1.0x
1.25x
1.5x
2.0x
3.0x
Sleep Timer
Off
End of Episode
5 Minutes
10 Minutes
15 Minutes
30 Minutes
45 Minutes
60 Minutes
120 Minutes