Name
Abstract | ||
|---|---|---|
We show that for every @e 0 almost every graph G @e G(n, p) is such that if (1+@e)log nlog d @?r@?(2-@e)log nlog d where d = 1q, then G contains a maximal induced tree of order r. |
Year | DOI | Venue |
|---|---|---|
1983 | 10.1016/0012-365X(83)90247-9 | Discrete Mathematics |
Keywords | Field | DocType |
random graph | Graph,Discrete mathematics,Combinatorics,Random graph,Mathematics | Journal |
Volume | Issue | ISSN |
46 | 2 | Discrete Mathematics |
Citations | PageRank | References |
11 | 3.30 | 2 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| P Erdös | 1 | 626 | 190.85 |
| Zbigniew Palka | 2 | 43 | 14.55 |