Connectivity in bridge-addable graph classes: the McDiarmid-Steger-Welsh conjecture

DOI10.1137/1.9781611974331.ch107zbMath1410.05179arXiv1504.06344OpenAlexW2949321006MaRDI QIDQ4575691

Guillaume Chapuy, Guillem Perarnau

Publication date: 16 July 2018

Published in: Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1504.06344

Mathematics Subject Classification ID

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

Related Items (4)

Connectivity for bridge-alterable graph classes ⋮ Logical properties of random graphs from small addable classes ⋮ The Evolution of Random Graphs on Surfaces ⋮ Logical limit laws for minor-closed classes of graphs

This page was built for publication: Connectivity in bridge-addable graph classes: the McDiarmid-Steger-Welsh conjecture