SPANNING SUBGRAPHS OF RANDOM GRAPHS

被引：32

作者：

ALON, N

FUREDI, Z

机构：

[1] TEL AVIV UNIV,RAYMOND & BEVERLY SACKLER FAC EXACT SCI,DEPT MATH,IL-69978 TEL AVIV,ISRAEL

[2] UNIV ILLINOIS,DEPT MATH,URBANA,IL 61801

[3] HUNGARIAN ACAD SCI,INST MATH,H-1364 BUDAPEST,HUNGARY

来源：

GRAPHS AND COMBINATORICS | 1992年 / 8卷 / 01期

关键词：

D O I：

10.1007/BF01271712

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

We propose a problem concerning the determination of the threshold function for the edge probability that guarantees, almost surely, the existence of various sparse spanning subgraphs in random graphs. We prove some bounds and demonstrate them in the cases of a d-cube and a two dimensional lattice.

引用

页码：91 / 94

页数：4