  Recent work has characterized the various inequalities that entanglement
entropies represented by min-cuts on hypergraphs will satisfy. This collection,
the hypergraph entropy cone, can be seen as a generalization of the holographic
entropy cone which describes the entropies given by both min-cuts on 2-graphs
and those of holographic states in AdS/CFT. In this article we describe a
generalization of bit threads which allows us to describe max multiflows on
hypergraphs. We further comment on its properties and interpretation in
holography.
