Pages that link to "Item:Q485502"
From MaRDI portal
The following pages link to On the density of triangles and squares in regular finite and unimodular random graphs (Q485502):
Displaying 7 items.
- Limit laws for the number of triangles in the generalized random graphs with random node weights (Q2307413) (← links)
- Matchings in regular graphs: minimizing the partition function (Q4997230) (← links)
- KOLMOGOROV BOUNDS FOR THE NORMAL APPROXIMATION OF THE NUMBER OF TRIANGLES IN THE ERDŐS–RÉNYI RANDOM GRAPH (Q5051220) (← links)
- Finite approximation for unimodular random networks (Q5064080) (← links)
- THE EXACT MINIMUM NUMBER OF TRIANGLES IN GRAPHS WITH GIVEN ORDER AND SIZE (Q5108414) (← links)
- Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques (Q5900943) (← links)
- Cycle density in infinite Ramanujan graphs (Q5962540) (← links)