Coloring random triangulations

被引：16
|
作者：
Di Francesco, P [1 ]
Eynard, B
Guitter, E
机构：
[1] Univ N Carolina, Dept Math, Chapel Hill, NC 27599 USA
[2] Univ Durham, Dept Math Sci, Sci Labs, Durham DH1 3HP, England
[3] CEA Saclay, Serv Phys Theor, F-91191 Gif Sur Yvette, France
来源：
NUCLEAR PHYSICS B | 1998年 / 516卷 / 03期
基金：
美国国家科学基金会;
关键词：
coloring; folding; random lattice; 2D quantum gravity;
D O I：
10.1016/S0550-3213(98)00037-6
中图分类号：
O412 [相对论、场论]; O572.2 [粒子物理学];
学科分类号：
摘要：
We introduce and solve a two-matrix model for the tri-coloring problem of the vertices of a random triangulation. We present three different solutions: (i) by orthogonal polynomial techniques, (ii) by use of a discrete Hirota bilinear equation, (iii) by direct expansion. The model is found to lie in the universality class of pure two-dimensional quantum gravity, despite the non-polynomiality of its potential. (C) 1998 Elsevier Science B.V.
引用
收藏
页码：543 / 587
页数：45
相关论文
共 50 条
  • [1] Coloring Eulerian Triangulations of the Klein Bottle
    Kral, Daniel
    Mohar, Bojan
    Nakamoto, Atsuhiro
    Pangrac, Ondrej
    Suzuki, Yusuke
    GRAPHS AND COMBINATORICS, 2012, 28 (04) : 499 - 530
  • [2] Coloring Eulerian Triangulations of the Klein Bottle
    Daniel Král’
    Bojan Mohar
    Atsuhiro Nakamoto
    Ondřej Pangrác
    Yusuke Suzuki
    Graphs and Combinatorics, 2012, 28 : 499 - 530
  • [3] Coloring Eulerian triangulations of the projective plane
    Mohar, B
    DISCRETE MATHEMATICS, 2002, 244 (1-3) : 339 - 343
  • [4] Clique coloring of dense random graphs
    Alon, Noga
    Krivelevich, Michael
    JOURNAL OF GRAPH THEORY, 2018, 88 (03) : 428 - 433
  • [5] COLORING RANDOM INTERSECTION GRAPHS AND COMPLEX NETWORKS
    Behrisch, Michael
    Taraz, Anusch
    Ueckerdt, Michael
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2009, 23 (01) : 288 - 299
  • [6] A Note on Random Greedy Coloring of Uniform Hypergraphs
    Cherkashin, Danila D.
    Kozik, Jakub
    RANDOM STRUCTURES & ALGORITHMS, 2015, 47 (03) : 407 - 413
  • [7] Scaling laws for maximum coloring of random geometric graphs
    Borst, Sem
    Bradonjic, Milan
    DISCRETE APPLIED MATHEMATICS, 2017, 217 : 427 - 437
  • [8] Between coloring and list-coloring: μ-coloring
    Bonomo, Flavia
    Cecowski Palacio, Mariano
    ARS COMBINATORIA, 2011, 99 : 383 - 398
  • [9] Perturbing isoradial triangulations
    David, Francois
    Scott, Jeanne
    ANNALES DE L INSTITUT HENRI POINCARE D, 2024, 11 (04): : 715 - 859
  • [10] Dominator coloring and CD coloring in almost cluster graphs ☆
    Banik, Aritra
    Kasthurirangan, Prahlad Narasimhan
    Raman, Venkatesh
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2025, 150
12345