关于三色随机树的独立数
On the independence number of random trees via tricolourations
摘要：
本文主要研究随机简单生成的大树的独立数及其相关参数，如匹配数、邻接矩阵的核维数等。我们用一个标准的三色表示这些量，这是一种用三种颜色给树的顶点着色的方法。作为应用，我们在$L^p$中得到了简单生成的大树（包括大尺寸条件Bienaymé-Galton-Watson树）的重正化独立数的极限定理.
英文摘要：
We are interested in the independence number of large random simply generated trees and related parameters, such as their matching number or the kernel dimension of their adjacency matrix. We express these quantities using a canonical tricolouration, which is a way to colour the vertices of a tree with three colours. As an application we obtain limit theorems in $L^p$ for the renormalised independence number in large simply generated trees (including large size-conditioned Bienaymé-Galton-Watson trees).
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
