Equitable orientations of sparse uniform hypergraphs

MaRDI QIDQ727210zbMATH OpenFDO

Authors Nathann Cohen, William Lochet

Publication date 6 December 2016

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

Full work available at URL https://arxiv.org/abs/1605.06321, http://www.combinatorics.org/ojs/index.php/eljc/article/view/v23i4p31

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

zbMATH Keywords

orientationshypergraphsentropy compressionlopsided Lovasz local lemma

Mathematics Subject Classification ID

Density (toughness, etc.) (05C42) Hypergraphs (05C65)

Abstract: Caro, West, and Yuster studied how $r$-uniform hypergraphs can be oriented in such a way that (generalizations of) indegree and outdegree are as close to each other as can be hoped. They conjectured an existence result of such orientations for sparse hypergraphs, of which we present a proof.

Recommendations

• Equitable hypergraph orientations
• On equitable colorings of sparse graphs
• Equitable Coloring ofk-Uniform Hypergraphs
• Equitable colorings of nonuniform hypergraphs
• Egalitarian graph orientations
• Equitable colorings of non-uniform simple hypergraphs
• On equitable colorings of hypergraphs
• Equitable two-colorings of uniform hypergraphs
• Equitable coloring of hypergraphs
• Equitable colorings of hypergraphs with few edges

Cites work

• A constructive proof of the general Lovász local lemma
• Equitable hypergraph orientations
• Lopsided Lovász Local lemma and Latin transversals

Cited in

(2)

• Degrees in oriented hypergraphs and sparse Ramsey theory
• Equitable hypergraph orientations

This page was built for publication: Equitable orientations of sparse uniform hypergraphs

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