Expected Maximum Block Size in Critical Random Graphs

DOI10.1017/S0963548319000154zbMath1434.05044OpenAlexW2962750524MaRDI QIDQ5219330

Vlady Ravelomanana, Vonjy Rasendrahasina, Andry Rasoanaivo

Publication date: 11 March 2020

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0963548319000154

zbMATH Keywords

uniform random graphgenerating function theory

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Random graphs (graph-theoretic aspects) (05C80) Exact enumeration problems, generating functions (05A15) Distance in graphs (05C12)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Random 2 XORSAT phase transition
• The first cycles in an evolving graph
• Finite size scaling for the core of large random hypergraphs
• Counting labeled general cubic graphs
• Random maps, coalescing saddles, singularity analysis, and Airy phenomena
• Graph classes with given 3-connected components: Asymptotic enumeration and random graphs
• Anatomy of a young giant component in the random graph
• The number of connected sparsely edged graphs. III. Asymptotic results
• A Random Graph With a Subcritical Number of Edges
• The number of connected sparsely edged graphs
• The Size of the Largest Components in Random Planar Maps
• Extremal Parameters in Sub-Critical Graph Classes
• The birth of the giant component
• On the probability of planarity of a random graph near the critical point
• Random Graphs

This page was built for publication: Expected Maximum Block Size in Critical Random Graphs