Name
Abstract | ||
|---|---|---|
For graphs G and H, let G→H signify that any red/blue edge coloring of G contains a monochromatic H as a subgraph. Let G(Kk(n),p) be random graph spaces with edge probability p, where Kk(n) is the complete k-partite graph with n vertices in each part. It is shown that if np→∞, then Pr[G(Kk(n),p)→P(k−1−o(1))n]→1 for k=2,3. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.1016/j.dam.2018.06.040 | Discrete Applied Mathematics |
Keywords | Field | DocType |
Ramsey number,Random graph,Sparse regularity lemma | Discrete mathematics,Edge coloring,Graph,Combinatorics,Monochromatic color,Random graph,Vertex (geometry),Bipartite graph,Ramsey's theorem,Mathematics | Journal |
Volume | ISSN | Citations |
254 | 0166-218X | 0 |
PageRank | References | Authors |
0.34 | 4 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Meng Liu | 1 | 39 | 18.70 |
| Yusheng Li | 2 | 31 | 8.30 |