Let Gn,d be a random d-regular graph with n vertices, where d = o（n）. Given a fixed graph H, YH denotes the number of induced copies of H in Gn d In this paper, the authors determine the threshold of the event ＂YH ...Let Gn,d be a random d-regular graph with n vertices, where d = o（n）. Given a fixed graph H, YH denotes the number of induced copies of H in Gn d In this paper, the authors determine the threshold of the event ＂YH 〉 0＂, and also obtain the induced subgraph counts inside the threshold interval.展开更多
基金This research is supported by the National Natural Science of Foundation under Grant Nos.10531070 and 10721101 of China.
文摘Let Gn,d be a random d-regular graph with n vertices, where d = o（n）. Given a fixed graph H, YH denotes the number of induced copies of H in Gn d In this paper, the authors determine the threshold of the event ＂YH 〉 0＂, and also obtain the induced subgraph counts inside the threshold interval.
