Sets that are connected in two random graphs

DOI10.1002/RSA.20491MaRDI QIDQ2930058zbMATH OpenOpenAlexFDO

Authors Michael Molloy

Publication date 17 November 2014

Published in 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

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

Recommendations

• On Random Intersection Graphs: The Subgraph Problem
• The intersection graph of random sets
• On the connectedness of a random graph
• scientific article; zbMATH DE number 3218580
• \(k\)-connectivity in random graphs

Cites work

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

Cited in

(2)

• When are random graphs connected
• The size of the giant joint component in a binomial random double graph

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

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