Topological cliques of random graphs

Authors

B. Bollobas, University of CambridgeFollow
P. A. Catlin, University of CambridgeFollow

Abstract

Given a graph G, denote by tcl(G) the largest integer r for which G contains a TKr, a toplogical complete r-graph. We show that for every ε{lunate} > 0 almost every graph G of order n satisfies (2-ε)n 1 2 ≤ tlc(G)≤(2+ε) 1 2. © 1981.

Publication Title

Journal of Combinatorial Theory, Series B

Recommended Citation

Bollobas, B., & Catlin, P. (1981). Topological cliques of random graphs. Journal of Combinatorial Theory, Series B, 30 (2), 224-227. https://doi.org/10.1016/0095-8956(81)90066-6