Equitable orientations of sparse uniform hypergraphs

zbMATH Open1351.05161arXiv1605.06321MaRDI QIDQ727210FDOQ727210

Authors: Nathann Cohen, William Lochet 

Publication date: 6 December 2016

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

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.

Full work available at URL: https://arxiv.org/abs/1605.06321

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

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

zbMATH Keywords

orientationshypergraphsentropy compressionlopsided Lovasz local lemma

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (2)

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

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)