On the density of triangles and squares in regular finite and unimodular random graphs
From MaRDI portal
Publication:485502
DOI10.1007/s00493-013-2907-0zbMath1313.05198arXiv1111.6007OpenAlexW2077110520MaRDI QIDQ485502
Publication date: 9 January 2015
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1111.6007
Random graphs (graph-theoretic aspects) (05C80) Paths and cycles (05C38) Random walks on graphs (05C81) Density (toughness, etc.) (05C42)
Related Items (2)
Matchings in regular graphs: minimizing the partition function ⋮ THE EXACT MINIMUM NUMBER OF TRIANGLES IN GRAPHS WITH GIVEN ORDER AND SIZE
Cites Work
- Unnamed Item
- Unnamed Item
- The measurable Kesten theorem
- On the number of \(C_ 5's\) in a triangle-free graph
- Processes on unimodular random networks
- On the Minimal Density of Triangles in Graphs
- A Survey on Spectra of infinite Graphs
- On complete subgraphs of different orders
- On the existence of regular n-graphs with given girth
- Regular Graphs with Given Girth and Restricted Circuits
This page was built for publication: On the density of triangles and squares in regular finite and unimodular random graphs