Indexed metadata
Equitable Hypergraph Orientations
Yair Caro, Douglas West, Raphael Yuster
Source 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 . We study the extent to which the result generalizes to uniform hypergraphs.
Evidence graph
No public relationships recorded yet.
Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.