更改

The number of proper colorings of random graphs given a number of q colors, called its chromatic polynomial, remains unknown so far. The scaling of zeros of the chromatic polynomial of random graphs with parameters n and the number of edges m or the connection probability p has been studied empirically using an algorithm based on symbolic pattern matching.

The number of proper colorings of random graphs given a number of q colors, called its chromatic polynomial, remains unknown so far. The scaling of zeros of the chromatic polynomial of random graphs with parameters n and the number of edges m or the connection probability p has been studied empirically using an algorithm based on symbolic pattern matching.

给定一个 ''q'' 颜色的随机图的真染色数，称为它的'''<font color="#FF8000">染色多项式 Chormatic Polynomial </font>'''，到目前为止还不清楚。利用'''<font color="#FF8000">符号模式匹配算法 Algorithm Based On Symbolic Pattern Matching </font>''' ，对参数为 ''n'' 、边数为 ''m'' 或连接概率为 ''p'' 的随机图的染色多项式零点的标度进行了实验研究。。

给定一个 ''q'' 颜色的随机图的真染色数，称为它的'''<font color="#FF8000">染色多项式 Chormatic Polynomial </font>'''（到目前为止还没有确定的正式名称）。利用'''<font color="#FF8000">符号模式匹配算法 Algorithm Based On Symbolic Pattern Matching </font>''' ，对参数为 ''n'' 、边数为 ''m'' 或连接概率为 ''p'' 的随机图的染色多项式零点的标度进行了实验研究。。

== Random trees ==

== Random trees ==