Equitable hypergraph orientations (Q540133)

From MaRDI portal
Revision as of 01:34, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Equitable hypergraph orientations
scientific article

    Statements

    Equitable hypergraph orientations (English)
    0 references
    0 references
    0 references
    0 references
    1 June 2011
    0 references
    Summary: 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.
    0 references
    0 references