Regular pairs in sparse random graphs I

Regular pairs in sparse random graphs I
复制标题

稀疏随机图中的正则对 I

DOI:
--
复制
发表时间:
2003
期刊:
Random Struct. Algorithms
影响因子:
--
通讯作者:
V. Rödl
V. Rödl
中科院分区:
--
文献类型:
--
作者:
Y. Kohayakawa;V. Rödl

文献摘要

被引文献

相似文献

我们考虑稀疏随机图的二部子图,这些子图在 Szemerédi 意义上是规则的,并且除其他外,表明它们必须满足某个局部伪随机属性。当考虑稀疏随机图子图中的嵌入问题时,该属性及其后果被证明是有用的。 © 2003 Wiley periodicals, Inc. 随机结构。阿尔法,22:359–434,2003
We consider bipartite subgraphs of sparse random graphs that are regular in the sense of Szemerédi and, among other things, show that they must satisfy a certain local pseudorandom property. This property and its consequences turn out to be useful when considering embedding problems in subgraphs of sparse random graphs. © 2003 Wiley Periodicals, Inc. Random Struct. Alg., 22: 359–434, 2003