Name
Abstract | ||
|---|---|---|
Answering a question of Kolaitis and Kopparty, we show that, for given integer q > 1 and pairwise nonisomorphic connected graphs G(1),...,G(k), if p = p(n) is such that Pr(G(n,p) superset of G(i)) -> 1 for all i, then, with xi i the number of copies of G(i) in G(n,p,) (xi(1),...,xi(k)) is asymptotically uniformly distributed on Z(q)(k). |
Year | Venue | Keywords |
|---|---|---|
2015 | ELECTRONIC JOURNAL OF COMBINATORICS | random graphs |
Field | DocType | Volume |
Integer,Discrete mathematics,Graph,Combinatorics,Random graph,Mathematics | Journal | 22 |
Issue | ISSN | Citations |
1.0 | 1077-8926 | 3 |
PageRank | References | Authors |
0.47 | 0 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Bobby DeMarco | 1 | 3 | 0.81 |
| Jeff Kahn | 2 | 11 | 1.81 |
| Amanda Redlich | 3 | 6 | 2.96 |