Equitable Hypergraph Orientations

  • Yair Caro
  • Douglas West
  • Raphael Yuster
DOI: https://doi.org/10.37236/608

Abstract

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.

Published
2011-05-23
How to Cite
Caro, Y., West, D., & Yuster, R. (2011). Equitable Hypergraph Orientations. The Electronic Journal of Combinatorics, 18(1), P121. https://doi.org/10.37236/608
Issue
Volume 18, Issue 1 (2011)
Article Number
P121