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:
Bibliographic Details
Published inInformation processing letters Vol. 104; no. 1; pp. 36 - 39
Main Author Ravelomanana, Vlady
Format Journal Article
LanguageEnglish
Published Amsterdam Elsevier B.V 30.09.2007
Elsevier Science
Elsevier Sequoia S.A
Subjects
Algorithmics. Computability. Computer arithmetics
Applied sciences
Combinatorics
Combinatorics. Ordered structures
Computer science; control theory; systems
Exact sciences and technology
Graph theory
Information retrieval. Graph
Mathematics
Miscellaneous
Sciences and techniques of general use
Studies
Theoretical computing
Edge(graph)
Computer theory
Information processing
Proof
Connected graph
Graph theory
Asymptotic approximation
Algorithm analysis
Online AccessGet full text

Cover

More Information
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