Counting Coloured Graphs of High Connectivity

DOI10.4153/CJM-1981-041-2zbMath0484.05042OpenAlexW2009690087MaRDI QIDQ3942983

Béla Bollobás

Publication date: 1981

Published in: Canadian Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.4153/cjm-1981-041-2

zbMATH Keywords

Random graphsk-partite colored graphs

Mathematics Subject Classification ID

Combinatorial probability (60C05) Coloring of graphs and hypergraphs (05C15) Connectivity (05C40)

Related Items (3)

Random I‐colorable graphs ⋮ Extreme degrees in random graphs ⋮ Diameters of random bipartite graphs

This page was built for publication: Counting Coloured Graphs of High Connectivity