Equitable hypergraph orientations (Q540133)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Equitable hypergraph orientations |
scientific article; zbMATH DE number 5903051
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Equitable hypergraph orientations |
scientific article; zbMATH DE number 5903051 |
Statements
Equitable hypergraph orientations (English)
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.8710660338401794
0 references
0.788460373878479
0 references
0.788460373878479
0 references
0.7623716592788696
0 references
0.7615851163864136
0 references
