Equitable hypergraph orientations

MaRDI QIDQ540133zbMATH OpenFDO

Authors Yair Caro, Douglas B. West, Raphael Yuster

Publication date 1 June 2011

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/229446, http://www.emis.de/journals/EJC/Volume_18/Abstracts/v18i1p121.html

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Mathematics Subject Classification ID

Hypergraphs (05C65)

Review text

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.

Recommendations

• Equitable orientations of sparse uniform hypergraphs
• On the orientation of graphs and hypergraphs
• A generalization of the Hajnal-Szemerédi theorem for uniform hypergraphs
• Equitable colorings of nonuniform hypergraphs
• Orientability Thresholds for Random Hypergraphs

Cited in

(2)

• Hypercube orientations with only two in-degrees
• Equitable orientations of sparse uniform hypergraphs

This page was built for publication: Equitable hypergraph orientations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q540133)