Publications of (and about) Paul Erdös
Autor: Erdös, Paul; Palka, Z.
Title: Trees in random graphs. (In English)
Source: Discrete Math. 46, 145-150 (1983); addendum ibid 48, 331 (1984).
Review: The probability space consisting of all graphs on a set of n vertices where each edge occurs with probability p, independently of all other edges, is denoted by G(n,p). Theorem: For each \epsilon > 0 almost every graph G in G(n,p) is such if (1+\epsilon) log n/ log d < r < (2- \epsilon) log n/ log d where d = 1/(1-p), then G contains a maximal induced tree of order d. Problem: Let p be a function of n, find such a value of p for which a graph G in G(n,p) has the greatest induced tree.
Classif.: * 05C80 Random graphs
60C05 Combinatorial probability
Keywords: induced star; maximal induced tree
© European Mathematical Society & FIZ Karlsruhe & Springer-Verlag