Almost every bipartite graph has not two vertices of minimum degree

Previous | Up | Next

Article

Almost every bipartite graph has not two vertices of minimum degree. (English). Mathematica Slovaca, vol. 43 (1993), issue 2, pp. 113-117

MSC: 05C35, 05C80 | MR 1274596 | Zbl 0795.05126

References:

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

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

[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 0463022 | Zbl 0378.05032

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

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

Partner of