Another Proof of Wright's Inequalities

Simple item page
dc.creatorRavelomanana, Vlady
dc.date2007-06-12
dc.date.accessioned2026-07-07T08:09:44Z
dc.date.available2026-07-07T08:09:44Z
dc.descriptionWe 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.
dc.identifierhttps://arxiv.org/abs/0706.1665
dc.identifierhttp://arxiv.org/abs/0706.1665
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/131624
dc.subjectDiscrete Mathematics
dc.subjectCombinatorics
dc.titleAnother Proof of Wright's Inequalities
dc.typetext

Files

Collections

arXiv