Voir la notice de l'article provenant de la source Math-Net.Ru
@article{DM_2011_23_1_a0, author = {E. S. Bernikovich and Yu. L. Pavlov}, title = {On the maximum size of a~tree in a~random unlabelled unrooted forest}, journal = {Diskretnaya Matematika}, pages = {3--20}, publisher = {mathdoc}, volume = {23}, number = {1}, year = {2011}, language = {ru}, url = {http://geodesic.mathdoc.fr/item/DM_2011_23_1_a0/} }
E. S. Bernikovich; Yu. L. Pavlov. On the maximum size of a~tree in a~random unlabelled unrooted forest. Diskretnaya Matematika, Tome 23 (2011) no. 1, pp. 3-20. http://geodesic.mathdoc.fr/item/DM_2011_23_1_a0/
[1] Pavlov Yu. L., Random forests, VSP, Utrecht, 2000 | MR
[2] Pavlov Yu. L., Loseva E. A., “Predelnye raspredeleniya maksimalnogo ob'ema dereva v sluchainom rekursivnom lese”, Diskretnaya matematika, 14:1 (2002), 60–74 | MR | Zbl
[3] Pavlov Yu. L., “Predelnye teoremy dlya ob'emov derevev v sluchainom nepomechennom lese”, Diskretnaya matematika, 17:2 (2005), 70–86 | MR | Zbl
[4] Khvorostyanskaya E. V., “Ob uslovii vozniknoveniya gigantskogo dereva v sluchainom nepomechennom lese”, Diskretnaya matematika, 19:3 (2007), 35–50 | MR | Zbl
[5] Kolchin V. F., Sluchainye grafy, Fizmatlit, Moskva, 2004
[6] Kharari F., Palmer E., Perechislenie grafov, Mir, Moskva, 1977 | MR
[7] Kolchin V. F., “O suschestvovanii gigantskoi komponenty v skhemakh razmescheniya chastits”, Obozrenie prikladnoi i promyshlennoi matematiki, 7:1 (2000), 112–113
[8] Ibragimov I. A., Linnik Yu. V., Nezavisimye i statsionarno svyazannye velichiny, Nauka, Moskva, 1965
[9] Kolchin A. V., “Predelnye teoremy dlya obobschennoi skhemy razmescheniya”, Diskretnaya matematika, 15:4 (2003), 148–157 | MR | Zbl
[10] Kazimirov N. I., “O nekotorykh usloviyakh otsutstviya gigantskoi komponenty v obobschennoi skheme razmescheniya”, Diskretnaya matematika, 14:2 (2002), 107–118 | MR | Zbl