Name
Abstract | ||
|---|---|---|
We say that a family of graphs * is p-quasi-random, 0pG(n,p); for a definition, see below. We denote by * the class of all graphs H for which * and the number of not necessarily induced labeled copies of H in Gn is at most (1+o(1))pe(H)nv(H) imply that * is p-quasi-random. In this note, we show that all complete bipartite graphs Ka,b, a,b≥2, belong to * for all 0p |
Year | DOI | Venue |
|---|---|---|
2004 | 10.1007/s00373-004-0556-1 | Graphs and Combinatorics |
Keywords | Field | DocType |
graphs h,bipartite subgraphs,complete bipartite graph,random graph | Discrete mathematics,Complete bipartite graph,Topology,Random regular graph,Combinatorics,Forbidden graph characterization,Robertson–Seymour theorem,Cograph,Mathematics,Pancyclic graph,Triangle-free graph,Split graph | Journal |
Volume | Issue | ISSN |
20 | 2 | 0911-0119 |
Citations | PageRank | References |
7 | 0.63 | 5 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jozef Skokan | 1 | 251 | 26.55 |
| Lubos Thoma | 2 | 42 | 5.34 |