论文信息 - Large induced trees in sparse random graphs

Large induced trees in sparse random graphs

Abstract We consider the size of the largest induced tree in random graphs, random regular graphs and random regular digraphs where the average degree is constant. In all cases we show that with probability 1 − o (1), such graphs have induced trees of size order n . In particular, the first result confirms a conjecture of Erdos and Palka ( Discrete Math. 46 (1983), 145–150).

Bill Jackson | Alan Frieze | A. Frieze | B. Jackson

[1] Alan M. Frieze,et al. Large holes in sparse random graphs , 1987, Comb..

[2] Marco Protasi,et al. The Largest Tree in a Random Graph , 1983, Theor. Comput. Sci..

[3] B. Bollobás. The evolution of random graphs , 1984 .

[4] Robin Wilson,et al. Graph theory and combinatorics , 1979 .

[5] J. Spencer. Probabilistic Methods in Combinatorics , 1974 .

[6] W. Hoeffding. Probability Inequalities for sums of Bounded Random Variables , 1963 .

[7] Béla Bollobás. Long paths in sparse random graphs , 1982, Comb..

[8] Wenceslas Fernandez de la Vega,et al. Induced trees in sparse random graphs , 1986, Graphs Comb..

[9] Paul Erdös,et al. Trees in random graphs , 1983, Discret. Math..

[10] Béla Bollobás,et al. A Probabilistic Proof of an Asymptotic Formula for the Number of Labelled Regular Graphs , 1980, Eur. J. Comb..

[11] Andrzej Rucinski,et al. On the order of the largest induced tree in a random graph , 1986, Discret. Appl. Math..