Graphs with restricted valency and matching number

Simple item page
dc.creatorBalachandran, Niranjan
dc.creatorKhare, Niraj
dc.date2006-11-27
dc.date.accessioned2026-07-07T07:33:24Z
dc.date.available2026-07-07T07:33:24Z
dc.descriptionConsider the family of all finite graphs with maximum degree $Δ(G)<d$ and matching number $ν(G)<m$. In this paper we give a new proof to obtain the exact upper bound for the number of edges in such graphs and also characterize all the cases when the maximal graph is unique. We also provide a new proof of Gallai's lemma concerning factor critical graphs.
dc.description13 pages
dc.identifierhttps://arxiv.org/abs/math/0611842
dc.identifierhttp://arxiv.org/abs/math/0611842
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/119446
dc.subjectCombinatorics
dc.subject05C35
dc.titleGraphs with restricted valency and matching number
dc.typetext

Files

Collections

arXiv