On the density of triangles and squares in regular finite and unimodular random graphs
Combinatorics
2011-11-28 v1
Abstract
We explicitly describe the possible pairs of triangle and square densities for r-regular finite simple graphs. We also prove that every r-regular unimodular random graph can be approximated by r-regular finite graphs with respect to these densities. As a corollary one gets an explicit description of the possible pairs of the third and fourth moments of the spectral measure of r-regular unimodular random graphs.
Keywords
Cite
@article{arxiv.1111.6007,
title = {On the density of triangles and squares in regular finite and unimodular random graphs},
author = {Viktor Harangi},
journal= {arXiv preprint arXiv:1111.6007},
year = {2011}
}