Geodesic
The number of components in a~random bipartite graph
Diskretnaya Matematika, Tome 1 (1989) no. 3, pp. 289-299

Voir la notice de l'article provenant de la source Math-Net.Ru

@article{DM_1989_1_3_a5,
     author = {I. B. Kalugin},
     title = {The number of components in a~random bipartite graph},
     journal = {Diskretnaya Matematika},
     pages = {289--299},
     publisher = {mathdoc},
     volume = {1},
     number = {3},
     year = {1989},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DM_1989_1_3_a5/}
}
TY  - JOUR
AU  - I. B. Kalugin
TI  - The number of components in a~random bipartite graph
JO  - Diskretnaya Matematika
PY  - 1989
SP  - 289
EP  - 299
VL  - 1
IS  - 3
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DM_1989_1_3_a5/
LA  - ru
ID  - DM_1989_1_3_a5
ER  - 
%0 Journal Article
%A I. B. Kalugin
%T The number of components in a~random bipartite graph
%J Diskretnaya Matematika
%D 1989
%P 289-299
%V 1
%N 3
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DM_1989_1_3_a5/
%G ru
%F DM_1989_1_3_a5
I. B. Kalugin. The number of components in a~random bipartite graph. Diskretnaya Matematika, Tome 1 (1989) no. 3, pp. 289-299. http://geodesic.mathdoc.fr/item/DM_1989_1_3_a5/