Equitable orientations of sparse uniform hypergraphs
Combinatorics
2016-05-23 v1
Abstract
Caro, West, and Yuster studied how -uniform hypergraphs can be oriented in such a way that (generalizations of) indegree and outdegree are as close to each other as can be hoped. They conjectured an existence result of such orientations for sparse hypergraphs, of which we present a proof.
Cite
@article{arxiv.1605.06321,
title = {Equitable orientations of sparse uniform hypergraphs},
author = {Nathann Cohen and William Lochet},
journal= {arXiv preprint arXiv:1605.06321},
year = {2016}
}