论文信息 - A Parametric Analysis of the Largest Induced Tree Problem in Random Graphs

A Parametric Analysis of the Largest Induced Tree Problem in Random Graphs

On presente l'evaluation de l'arbre induit maximal pour une large famille de graphes aleatoires. On demontre par cette voie une conjecture d'Erdos-Palka

Maurizio Talamo | Marco Protasi

[1] Maurizio Talamo,et al. On the Maximum Size of Random Trees , 1985, TAPSOFT, Vol.1.

[2] Maurizio Talamo,et al. A New Probabilistic Model for the Study of Algorithmic Properties of Random Graph Problems , 1983, FCT.

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

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

[5] J. Friedman. Constructing O(n log n) Size Monotone Formulae for the k-th Elementary Symmetric Polynomial of n Boolean Variables , 1984, FOCS.