Almost every bipartite graph has not two vertices of minimum degree
Mathematica Slovaca (1993)
- Volume: 43, Issue: 2, page 113-117
- ISSN: 0232-0525
Access Full Article
top
How to cite
topBukor, József. "Almost every bipartite graph has not two vertices of minimum degree." Mathematica Slovaca 43.2 (1993): 113-117. <http://eudml.org/doc/32278>.
@article{Bukor1993,
author = {Bukor, József},
journal = {Mathematica Slovaca},
keywords = {random bipartite graph; minimum degree},
language = {eng},
number = {2},
pages = {113-117},
publisher = {Mathematical Institute of the Slovak Academy of Sciences},
title = {Almost every bipartite graph has not two vertices of minimum degree},
url = {http://eudml.org/doc/32278},
volume = {43},
year = {1993},
}
TY - JOUR
AU - Bukor, József
TI - Almost every bipartite graph has not two vertices of minimum degree
JO - Mathematica Slovaca
PY - 1993
PB - Mathematical Institute of the Slovak Academy of Sciences
VL - 43
IS - 2
SP - 113
EP - 117
LA - eng
KW - random bipartite graph; minimum degree
UR - http://eudml.org/doc/32278
ER -
References
top- BOLLOBÁS B., Degree sequences of random graphs, Discrete Math. 33 (1981), 1-19. (1981) Zbl0447.05038MR0597223
- BOLLOBÁS B., Vertices of given degree in a random graph, J. Graph Theory 6 (1982), 147-155. (1982) Zbl0499.05056MR0655200
- ERDÖS P., WILSON R. J., On the chromatic index of almost all graphs, J. Combin. Theory Ser. B 23 (1977), 255-257. (1977) Zbl0378.05032MR0463022
- FELLER W., An Introduction to Probability Theory and its Applications Vol 1, Wiley, New York, 1968. (1968) MR0228020
- PALKA Z., Extreme degrees in random graphs, J. Graph Theory 11 (1987), 121-134. (1987) Zbl0672.05069MR0889344
NotesEmbed ?
topYou must be logged in to post comments.
To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.