Geodesic
Equitable hypergraph orientations
The electronic journal of combinatorics, Tome 18 (2011) no. 1
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

A classical result in graph theory asserts that every graph can be oriented so that the indegree and outdegree of each vertex differ by at most $1$. We study the extent to which the result generalizes to uniform hypergraphs.
DOI : 10.37236/608
Classification : 05C65 
@article{10_37236_608,
     author = {Yair Caro and Douglas West and Raphael Yuster},
     title = {Equitable hypergraph orientations},
     journal = {The electronic journal of combinatorics},
     year = {2011},
     volume = {18},
     number = {1},
     doi = {10.37236/608},
     zbl = {1217.05171},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/608/}
}
TY  - JOUR
AU  - Yair Caro
AU  - Douglas West
AU  - Raphael Yuster
TI  - Equitable hypergraph orientations
JO  - The electronic journal of combinatorics
PY  - 2011
VL  - 18
IS  - 1
UR  - http://geodesic.mathdoc.fr/articles/10.37236/608/
DO  - 10.37236/608
ID  - 10_37236_608
ER  - 
%0 Journal Article
%A Yair Caro
%A Douglas West
%A Raphael Yuster
%T Equitable hypergraph orientations
%J The electronic journal of combinatorics
%D 2011
%V 18
%N 1
%U http://geodesic.mathdoc.fr/articles/10.37236/608/
%R 10.37236/608
%F 10_37236_608
Yair Caro; Douglas West; Raphael Yuster. Equitable hypergraph orientations. The electronic journal of combinatorics, Tome 18 (2011) no. 1. doi: 10.37236/608

Cité par Sources :