Another Proof of Wright's Inequalities
Vlady Ravelomanana (LIPN)
TL;DR
This paper offers a concise proof of Wright's inequalities related to counting connected graphs with a specific number of edges exceeding vertices, simplifying previous approaches.
Contribution
It introduces a shorter, more elegant proof of Wright's inequalities on connected graphs, enhancing understanding and accessibility.
Findings
Simplified proof of Wright's inequalities
Clarified bounds on connected graphs with excess edges
Improved mathematical understanding of graph enumeration
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 edges more than vertices.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsLimits and Structures in Graph Theory · Graph theory and applications · Advanced Graph Theory Research