Another proof of Wright's inequalities

Authors:
Vlady Ravelomanana
Affiliations:
LIPN -- UMR 7030, Institut Galilée -- Université de Paris-Nord, 99, Avenue J.B. Clément, F 93430 Villetaneuse, France
Venue:
Information Processing Letters
Year:
2007

Citing 4
Cited 3

Counting connected graphs inside-out

Journal of Combinatorial Theory Series B
Counting connected graphs asymptotically

European Journal of Combinatorics - Special issue on extremal and probabilistic combinatorics
The Average Size of Giant Components between the Double-Jump

Algorithmica
Analytic Combinatorics

Analytic Combinatorics

Random 2-XORSAT at the satisfiability threshold

LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
Birth and growth of multicyclic components in random hypergraphs

Theoretical Computer Science
Limit theorems for random MAX-2-XORSAT

LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics

Quantified Score

Hi-index	0.90

Visualization

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.