pith. sign in

arxiv: 0706.1665 · v1 · submitted 2007-06-12 · 💻 cs.DM · math.CO

Another Proof of Wright's Inequalities

classification 💻 cs.DM math.CO
keywords inequalitieswrightanotherconcerningconnectededgesgraphgraphs
0
0 comments X
read the original abstract

We present a short way of proving the inequalities obtained by Wright in [Journal of Graph Theory, 4: 393 - 407 (1980)] concerning the number of connected graphs with $\ell$ edges more than vertices.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.