Sets that are connected in two random graphs

DOI10.1002/rsa.20491zbMath1302.05171OpenAlexW2030099274MaRDI QIDQ2930058

Michael S. O. Molloy

Publication date: 17 November 2014

Published in: Random Structures & Algorithms, Random Structures \& Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/rsa.20491

zbMATH Keywords

doubled connected set

Mathematics Subject Classification ID

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

Related Items (1)

The size of the giant joint component in a binomial random double graph

Cites Work

• Counting connected graphs inside-out
• Sudden emergence of a giant \(k\)-core in a random graph
• A simple solution to the k‐core problem
• The Evolution of Random Graphs
• Component behavior near the critical point of the random graph process
• Cores in random hypergraphs and Boolean formulas
• A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
• Graph colouring and the probabilistic method

This page was built for publication: Sets that are connected in two random graphs