A RANDOM GRAPH WITH A SUBCRITICAL NUMBER OF EDGES

被引：0

作者：

PITTEL, B ^{[1
]}

机构：

[1] OHIO STATE UNIV, DEPT MATH, COLUMBUS, OH 43210 USA

来源：

TRANSACTIONS OF THE AMERICAN MATHEMATICAL SOCIETY | 1988年 / 309卷 / 01期

关键词：

D O I：

暂无

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

引用

页码：51 / 75

页数：25

共 50 条

[31] The Domination Number of a Random Graph
Henning, Michael A.
Yeo, Anders
UTILITAS MATHEMATICA, 2014, 94 : 315 - 328
[32] THE NUMBER OF CONTRACTIBLE EDGES IN A 4-CONNECTED GRAPH HAVING A SMALL NUMBER OF EDGES NOT CONTAINED IN TRIANGLES
Kotani, Keiko
Nakamura, Shunsuke
ADVANCES AND APPLICATIONS IN DISCRETE MATHEMATICS, 2015, 15 (02): : 153 - 166
[33] Edges not contained in triangles and the number of contractible edges in a 4-connected graph
Ando, Kiyoshi
Egawa, Yoshimi
DISCRETE MATHEMATICS, 2008, 308 (23) : 5463 - 5472
[34] A new upper bound on the number of edges in a geodetic graph
Mao, JZ
Li, DY
DISCRETE MATHEMATICS, 1999, 202 (1-3) : 183 - 189
[35] Estimate of the Number of Edges in Special Subgraphs of a Distance Graph
Pushnyakov, F. A.
Raigorodskii, A. M.
MATHEMATICAL NOTES, 2020, 107 (1-2) : 322 - 332
[36] On the number of edges in induced subgraphs of a special distance graph
F. A. Pushnyakov
Mathematical Notes, 2016, 99 : 545 - 551
[37] On the number of edges not covered by monochromatic copies of a fixed graph
Keevash, P
Sudakov, B
JOURNAL OF COMBINATORIAL THEORY SERIES B, 2004, 90 (01) : 41 - 53
[38] RECTILINEAR FOLDING OF A GRAPH WITH QUASIMINIMAL NUMBER OF INTERSECTIONS OF EDGES
TETELBAUM, AY
SOVIET JOURNAL OF COMPUTER AND SYSTEMS SCIENCES, 1989, 27 (05): : 153 - 155
[39] On the number of edges in induced subgraphs of a special distance graph
Pushnyakov, F. A.
MATHEMATICAL NOTES, 2016, 99 (3-4) : 545 - 551
[40] HOW MANY RANDOM EDGES MAKE A GRAPH HAMILTONIAN
SHAMIR, E
COMBINATORICA, 1983, 3 (01) : 123 - 131

← 1 2 3 4 5 →