Caro, West, and Yuster (2011) studied how $r$-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.
@article{10_37236_6152,
author = {Nathann Cohen and William Lochet},
title = {Equitable orientations of sparse uniform hypergraphs},
journal = {The electronic journal of combinatorics},
year = {2016},
volume = {23},
number = {4},
doi = {10.37236/6152},
zbl = {1351.05161},
url = {http://geodesic.mathdoc.fr/articles/10.37236/6152/}
}
TY - JOUR
AU - Nathann Cohen
AU - William Lochet
TI - Equitable orientations of sparse uniform hypergraphs
JO - The electronic journal of combinatorics
PY - 2016
VL - 23
IS - 4
UR - http://geodesic.mathdoc.fr/articles/10.37236/6152/
DO - 10.37236/6152
ID - 10_37236_6152
ER -
%0 Journal Article
%A Nathann Cohen
%A William Lochet
%T Equitable orientations of sparse uniform hypergraphs
%J The electronic journal of combinatorics
%D 2016
%V 23
%N 4
%U http://geodesic.mathdoc.fr/articles/10.37236/6152/
%R 10.37236/6152
%F 10_37236_6152
Nathann Cohen; William Lochet. Equitable orientations of sparse uniform hypergraphs. The electronic journal of combinatorics, Tome 23 (2016) no. 4. doi: 10.37236/6152
