On the density of triangles and squares in regular finite and unimodular random graphs

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.

This is a preview of subscription content, access via your institution.

References

  1. [1]

    M. Abért, Y. Glasner and B. Virág: The measurable Kesten theorem, Preprint, 2011. arXiv:1111.2080.

    Google Scholar 

  2. [2]

    D. Aldous and R. Lyons: Processes on unimodular random networks, Electron. J. Probab. 12 (2007), 1454–1508.

    MathSciNet  Article  MATH  Google Scholar 

  3. [3]

    B. Bollobás: On complete subgraphs of different orders, Math. Proc. Camb. Phil. Soc., 79 (1976), 19–24.

    Article  MATH  Google Scholar 

  4. [4]

    B. Bollobás: Extremal graph theory Dover Books on Mathematics, Dover Publications, 2004.

    Google Scholar 

  5. [5]

    P. Erdős and H. Sachs: Regul are Graphen gegebener Taillenweite mit minimaler Knotenzahl, Wiss. Z. Univ. Halle, Math.-Nat. 12 (1963), 251–258.

    Google Scholar 

  6. [6]

    E. Győri: On the number of C 5’s in a triangle-free graph, Combinatorica 9 (1989), 101–102.

    MathSciNet  Article  Google Scholar 

  7. [7]

    H. Hatami, J. Hladký, D. Král’, S. Norine and A. Razborov: On the number of pentagons in triangle-free graphs, Preprint, 2011. arXiv:1102.1634v2.

    Google Scholar 

  8. [8]

    L. Lovász and M. Simonovits: On the number of complete subgraphs of a graph, ii, in: Studies in pure mathematics, 459–495. Birkhäuser, 1983.

    Google Scholar 

  9. [9]

    B. Mohar and W. Woess: A survey on spectra of infinite graphs, Bull. London Math. Soc. 21 (1989), 209–234.

    MathSciNet  Article  MATH  Google Scholar 

  10. [10]

    A. Razborov: On the minimal density of triangles in graphs, Combin. Probab. Comput. 17 (2008), 603–618.

    MathSciNet  MATH  Google Scholar 

  11. [11]

    H. Sachs: Regular graphs with given girth and restricted circuits, J. London Math. Soc. 38 (1963), 423–429.

    MathSciNet  Article  MATH  Google Scholar 

  12. [12]

    N. Sauer: On the existence of regular n-graphs with given girth, J. Combin. Theory 9 (1970), 144–147.

    MathSciNet  Article  MATH  Google Scholar 

Download references

Author information

Affiliations

Authors

Corresponding author

Correspondence to Viktor Harangi.

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Harangi, V. On the density of triangles and squares in regular finite and unimodular random graphs. Combinatorica 33, 531–548 (2013). https://doi.org/10.1007/s00493-013-2907-0

Download citation

Mathematics Subject Classification (2010)

  • Primary 05C38
  • Secondary 05C80, 05C81