Counting extensions revisited
Counting extensions revisited
复制标题
重新审视扩展计数
DOI:
10.1002/rsa.21050
复制
发表时间:
2022
影响因子:
1
通讯作者:
Warnke, Lutz
中科院分区:
文献类型:
--
作者:
Šileikis, Matas;Warnke, Lutz
We consider rooted subgraphs in random graphs, that is, extension counts such as (i) the number of triangles containing a given vertex or (ii) the number of paths of length three connecting two given vertices. In 1989, Spencer gave sufficient conditions for the event that, with high probability, these extension counts are asymptotically equal for all choices of the root vertices. For the important strictly balanced case, Spencer also raised the fundamental question as to whether these conditions are necessary. We answer this question by a careful second moment argument, and discuss some intriguing problems that remain open.
登录
查看更多内容
影响因子:
1
作者:
Šileikis, Matas;Warnke, Lutz
通讯作者:
Warnke, Lutz
DOI:
--
发表时间:
1991
期刊:
影响因子:
--
作者:
T. Luczak;J. Spencer
通讯作者:
J. Spencer
影响因子:
1
作者:
M. Schacht;Fabian Schulenburg
通讯作者:
Fabian Schulenburg
影响因子:
3.9
作者:
S. Shelah;J. Spencer
通讯作者:
S. Shelah;J. Spencer
DOI:
10.1016/j.jctb.2019.05.003
发表时间:
2019
期刊:
Series B
影响因子:
--
作者:
Warnke, Lutz
通讯作者:
Warnke, Lutz