| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 428328 | Information Processing Letters | 2007 | 4 Pages |
Abstract
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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
