Equitable Orientations of Sparse Uniform Hypergraphs

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.

Saved in:
Bibliographic Details
Published inThe Electronic journal of combinatorics Vol. 23; no. 4; pp. 4 - 31
Main Authors Cohen, Nathann, Lochet, William
Format Journal Article
LanguageEnglish
Published Open Journal Systems 25.11.2016
Subjects
Combinatorics
Computational Complexity
Computer Science
Data Structures and Algorithms
Mathematics
Online AccessGet full text

Cover

More Information
Summary: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.
ISSN:1077-8926
1077-8926
DOI:10.37236/6152