Title

Topological cliques of random graphs

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

Share

COinS