Another proof of Wright's inequalities
We present a short way of proving the inequalities obtained by Wright in [E.M. Wright, The number of connected sparsely edged graphs III: Asymptotic results, Journal of Graph Theory 4 (1980) 393–407] concerning the number of connected graphs with ℓ edges more than vertices.
Saved in:
Published in | Information processing letters Vol. 104; no. 1; pp. 36 - 39 |
---|---|
Main Author | |
Format | Journal Article |
Language | English |
Published |
Amsterdam
Elsevier B.V
30.09.2007
Elsevier Science Elsevier Sequoia S.A |
Subjects | |
Online Access | Get full text |
Cover
Loading…
Summary: | We present a short way of proving the inequalities obtained by Wright in [E.M. Wright, The number of connected sparsely edged graphs III: Asymptotic results, Journal of Graph Theory 4 (1980) 393–407] concerning the number of connected graphs with
ℓ edges more than vertices. |
---|---|
ISSN: | 0020-0190 1872-6119 |
DOI: | 10.1016/j.ipl.2007.05.003 |