Maximum number of symmetric extensions in random graphs

DOI10.1137/23m1588706MaRDI QIDQ6622732

Stepan Vakhrushev, M. E. Zhukovskii

Publication date: 22 October 2024

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

extreme value distributionsrandom graphslimit lawsgraph extensions

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Extreme value theory; extremal stochastic processes (60G70)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The early evolution of the \(H\)-free process
• Two moments suffice for Poisson approximations: The Chen-Stein method
• The distribution of the maximum degree of a random graph
• Coupling and Poisson approximation
• Limiting forms of the frequency distribution of the largest or smallest member of a sample.
• Threshold functions for extension statements
• The distribution of the maximum number of common neighbors in the random graph
• Random triangle removal
• Counting extensions
• Sur la distribution limite du terme maximum d'une série aléatoire
• Zero-One Laws for Sparse Random Graphs
• When Does the Zero-One Law Hold?
• On the Asymptotic Behavior of Degrees of Vertices in a Random Graph
• Random graphs with monochromatic triangles in every edge coloring
• Dynamic concentration of the triangle‐free process
• Counting extensions revisited
• A note on the distribution of the extreme degrees of a random graph via the Stein-Chen method

This page was built for publication: Maximum number of symmetric extensions in random graphs