Maximum directed cuts in digraphs with degree restriction

Simple item page
dc.creatorLehel, Jenö
dc.creatorMaffray, Frédéric
dc.creatorPreissmann, Myriam
dc.date2007-11-26
dc.date.accessioned2026-07-07T08:45:44Z
dc.date.available2026-07-07T08:45:44Z
dc.descriptionFor integers m,k >= 1, we investigate the maximum size of a directed cut in directed graphs in which there are m edges and each vertex has either indegree at most k or outdegree at most k.
dc.identifierhttps://arxiv.org/abs/0711.3958
dc.identifierhttp://arxiv.org/abs/0711.3958
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/143053
dc.subjectDiscrete Mathematics
dc.titleMaximum directed cuts in digraphs with degree restriction
dc.typetext

Files

Collections

arXiv