Equitable hypergraph orientations

Yair Caro, Douglas West, Raphael Yuster

Research output: Contribution to journalArticlepeer-review


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.

Original languageEnglish
Pages (from-to)1-6
Number of pages6
JournalElectronic Journal of Combinatorics
Issue number1
StatePublished - 2011

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Geometry and Topology
  • Discrete Mathematics and Combinatorics
  • Computational Theory and Mathematics
  • Applied Mathematics


Dive into the research topics of 'Equitable hypergraph orientations'. Together they form a unique fingerprint.

Cite this