HAMILTON CYCLES IN A CLASS OF RANDOM DIRECTED-GRAPHS

被引：11

作者：

COOPER, C ^{[1
]}

FRIEZE, A ^{[1
]}

机构：

[1] CARNEGIE MELLON UNIV,DEPT MATH,PITTSBURGH,PA 15213

来源：

JOURNAL OF COMBINATORIAL THEORY SERIES B | 1994年 / 62卷 / 01期

关键词：

D O I：

10.1006/jctb.1994.1060

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

We prove that almost every 3-in, 3-out digraph is Hamiltonian. (C) 1994 Academic Press, Inc.

引用

收藏

页码：151 / 163

页数：13

相关论文

共 8 条

[1] THE LIMITING PROBABILITY THAT ALPHA-IN, BETA-OUT IS STRONGLY CONNECTED
COOPER, C
FRIEZE, AM
[J]. JOURNAL OF COMBINATORIAL THEORY SERIES B, 1990, 48 (01) : 117 - 134
[2] FELLER W, 1966, INTRO PROBABILITY TH, V1
[3] ON THE CONNECTIVITY OF RANDOM M-ORIENTABLE GRAPHS AND DIGRAPHS
FENNER, TI
FRIEZE, AM
[J]. COMBINATORICA, 1982, 2 (04) : 347 - 359
[4] FRIEZE AM, P RANDOM GRAPHS 87
[5] PROBABILITY-INEQUALITIES FOR SUMS OF BOUNDED RANDOM-VARIABLES
HOEFFDING, W
[J]. JOURNAL OF THE AMERICAN STATISTICAL ASSOCIATION, 1963, 58 (301) : 13 - +
[6] Kolchin V. F., 1986, RANDOM MAPPINGS
[7] REED B, 1992, COMB PROBAB COMPUT, V1, P265
[8] MATCHINGS IN RANDOM REGULAR BIPARTITE DIGRAPHS
WALKUP, DW
[J]. DISCRETE MATHEMATICS, 1980, 31 (01) : 59 - 64