Vertex Order in Some Large Constrained Random Graphs

DOI10.1137/16M1061898zbMath1344.05125OpenAlexW2512994459MaRDI QIDQ3188316

Hans Koch

Publication date: 19 August 2016

Published in: SIAM Journal on Mathematical Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/16m1061898

zbMATH Keywords

random graphsedge densitytriangle densitygraphonsconstrained maximizersfinite-podal

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80)

Related Items (2)

Moderate deviations in cycle count ⋮ Phase transitions in finite random networks

Cites Work

• Unnamed Item
• The large deviation principle for the Erdős-Rényi random graph
• Singularities in the entropy of asymptotically large simple graphs
• Estimating and understanding exponential random graph models
• Measure preserving transformations and rearrangements
• Phase transitions in a complex network
• On the Minimal Density of Triangles in Graphs
• Bipodal Structure in Oversaturated Random Graphs
• Asymptotic Structure of Graphs with the Minimum Number of Triangles
• The asymptotics of large constrained graphs

This page was built for publication: Vertex Order in Some Large Constrained Random Graphs