Realizing degree imbalances in directed graphs

Simple item page
dc.creatorMubayi, Dhruv
dc.creatorWill, Todd G.
dc.creatorWest, Douglas B.
dc.date1998-07-09
dc.date.accessioned2026-07-07T05:25:20Z
dc.date.available2026-07-07T05:25:20Z
dc.descriptionIn a directed graph, the imbalance of a vertex is its outdegree minus its indegree. We characterize the sequences that are realizable as the sequence of imbalances of a simple directed graph. Moreover, a realization of a realizable sequence can be produced by a greedy algorithm.
dc.description5 pages
dc.identifierhttps://arxiv.org/abs/math/9807043
dc.identifierhttp://arxiv.org/abs/math/9807043
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/77139
dc.subjectCombinatorics
dc.subject05C20
dc.titleRealizing degree imbalances in directed graphs
dc.typetext

Files

Collections

arXiv