Matrix models and graph coloring
Dec, 1992
11 pages
Published in:
- Phys.Lett.B 306 (1993) 245-251
Report number:
- BARI-TH-92-130
View in:
Citations per year
Abstract: (Elsevier)
We study an edge-colouring problem on random planar graphs which is one of the simplest vertex models that may be analyzed by standard methods of large N matrix models. The main features of the saddle point solution and its critical behaviour are described. At the critical value of the coupling g cr the eigen value density u ( λ ) M is found to vanish at the border of the support as |λ−a| 2 3 .- matrix model
- partition function
- Feynman graph: planar
- critical phenomena
- expansion 1/N
References(2)
Figures(0)