Tripodal structure in undersaturated random graphs

DOI10.61091/OJAC20-04MaRDI QIDQ6858461zbMATH OpenFDO

Authors William DiCarlo, Lorenzo Sadun

Publication date 13 February 2026

Published in Online Journal of Analytic Combinatorics (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.61091/OJAC20-04

zbMATH Keywords

entropyErdős-Rényigraphonphase transitiontripodal

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05)

Cites work

• Asymptotic structure of graphs with the minimum number of triangles
• Bipodal structure in oversaturated random graphs
• Convergent sequences of dense graphs. I: Subgraph frequencies, metric properties and testing
• Existence of a symmetric bipodal phase in the edge-triangle model
• Large networks and graph limits
• Limits of dense graph sequences
• Moderate deviations in cycle count
• Moderate deviations of subgraph counts in the Erdős-Rényi random graphs \(G(n,m)\) and \(G(n,p)\)
• Moments of two-variable functions and the uniqueness of graph limits
• Multipodal structure and phase transitions in large constrained graphs
• On a General Class of Models for Interaction
• On the Minimal Density of Triangles in Graphs
• Phase transitions in a complex network
• The large deviation principle for the Erdős-Rényi random graph
• The phases of large networks with edge and triangle constraints
• Typical large graphs with given edge and triangle densities
• Upper tails via high moments and entropic stability

This page was built for publication: Tripodal structure in undersaturated random graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6858461)