Name
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 ϵ > 0 almost every graph G of order n satisfies (2−ε)n12 ⩽ tlc(G)⩽(2+ε)12 |
Year | DOI | Venue |
|---|---|---|
1981 | 10.1016/0095-8956(81)90066-6 | Journal of Combinatorial Theory, Series B |
Keywords | Field | DocType |
random graph | Discrete mathematics,Random regular graph,Topology,Combinatorics,Graph toughness,Edge-transitive graph,Graph power,Bound graph,Universal graph,Intersection number (graph theory),Mathematics,Voltage graph | Journal |
Volume | Issue | ISSN |
30 | 2 | 0095-8956 |
Citations | PageRank | References |
13 | 4.09 | 2 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| B. Bollobas | 1 | 195 | 79.32 |
| Paul A. Catlin | 2 | 514 | 66.29 |