Geodesic
Almost every bipartite graph has not two vertices of minimum degree
Mathematica slovaca, Tome 43 (1993) no. 2, pp. 113-117
Cet article a éte moissonné depuis la source Czech Digital Mathematics Library

Voir la notice de l'article

Classification : 05C35, 05C80 
@article{MASLO_1993_43_2_a0,
     author = {Bukor, Jozef},
     title = {Almost every bipartite graph has not two vertices of minimum degree},
     journal = {Mathematica slovaca},
     pages = {113--117},
     year = {1993},
     volume = {43},
     number = {2},
     mrnumber = {1274596},
     zbl = {0795.05126},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/MASLO_1993_43_2_a0/}
}
TY  - JOUR
AU  - Bukor, Jozef
TI  - Almost every bipartite graph has not two vertices of minimum degree
JO  - Mathematica slovaca
PY  - 1993
SP  - 113
EP  - 117
VL  - 43
IS  - 2
UR  - http://geodesic.mathdoc.fr/item/MASLO_1993_43_2_a0/
LA  - en
ID  - MASLO_1993_43_2_a0
ER  - 
%0 Journal Article
%A Bukor, Jozef
%T Almost every bipartite graph has not two vertices of minimum degree
%J Mathematica slovaca
%D 1993
%P 113-117
%V 43
%N 2
%U http://geodesic.mathdoc.fr/item/MASLO_1993_43_2_a0/
%G en
%F MASLO_1993_43_2_a0
Bukor, Jozef. Almost every bipartite graph has not two vertices of minimum degree. Mathematica slovaca, Tome 43 (1993) no. 2, pp. 113-117. http://geodesic.mathdoc.fr/item/MASLO_1993_43_2_a0/

[1] BOLLOBÁS B.: Degree sequences of random graphs. Discrete Math. 33 (1981), 1-19. | MR | Zbl

[2] BOLLOBÁS B.: Vertices of given degree in a random graph. J. Graph Theory 6 (1982), 147-155. | MR | Zbl

[3] ERDÖS P., WILSON R. J.: On the chromatic index of almost all graphs. J. Combin. Theory Ser. B 23 (1977), 255-257. | MR | Zbl

[4] FELLER W.: An Introduction to Probability Theory and its Applications Vol 1. Wiley, New York, 1968. | MR

[5] PALKA Z.: Extreme degrees in random graphs. J. Graph Theory 11 (1987), 121-134. | MR | Zbl