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.
Cite
CITATION STYLE
APA
Caro, Y., West, D., & Yuster, R. (2011). Equitable hypergraph orientations. Electronic Journal of Combinatorics, 18(1), 1–6. https://doi.org/10.37236/608
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free