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.
| Original language | English |
|---|---|
| Pages (from-to) | 1-6 |
| Number of pages | 6 |
| Journal | Electronic Journal of Combinatorics |
| Volume | 18 |
| Issue number | 1 |
| DOIs | |
| State | Published - 2011 |
ASJC Scopus subject areas
- Theoretical Computer Science
- Geometry and Topology
- Discrete Mathematics and Combinatorics
- Computational Theory and Mathematics
- Applied Mathematics