Subgraph Counts and Containment Probabilities of Balanced and Unbalanced Subgraphs in a Large Random Graph

Authors

BÉLA BOLLOBÁS, University of CambridgeFollow
JOHN C. WIERMAN, Johns Hopkins University

Publication Title

Annals of the New York Academy of Sciences

Recommended Citation

BOLLOBÁS, B., & WIERMAN, J. (1989). Subgraph Counts and Containment Probabilities of Balanced and Unbalanced Subgraphs in a Large Random Graph. Annals of the New York Academy of Sciences, 576 (1), 63-70. https://doi.org/10.1111/j.1749-6632.1989.tb16383.x