Every 8-uniform 8-regular hypergraph is 2-colorable

DOI10.1007/BF01864169zbMath0725.05061MaRDI QIDQ2277485

Z. Bregman, Noga Alon

Publication date: 1988

Published in: Graphs and Combinatorics (Search for Journal in Brave)

zbMATH Keywords

coloringd-uniform d-regular hypergraph

Mathematics Subject Classification ID

Hypergraphs (05C65) Coloring of graphs and hypergraphs (05C15)

Related Items (21)

Not-all-equal 3-SAT and 2-colorings of 4-regular 4-uniform hypergraphs ⋮ Coloring and the Lovász local lemma ⋮ Hypergraph colouring and the Lovász local lemma ⋮ Blocking set free configurations and their relations to digraphs and hypergraphs ⋮ Partitioning claw-free subcubic graphs into two dominating sets ⋮ A General Framework for Hypergraph Coloring ⋮ On 2-Colorings of Hypergraphs ⋮ On proper colorings of hypergraphs ⋮ The prime submodules hypergraph of a free module of finite rank over a commutative ring ⋮ Cubic graphs with total domatic number at least two ⋮ Concepts on coloring of cluster hypergraphs with application ⋮ On the difference between chromatic number and dynamic chromatic number of graphs ⋮ Minimal non-odd-transversal hypergraphs and minimal non-odd-bipartite hypergraphs ⋮ Color-blind index in graphs of very low degree ⋮ Polychromatic colorings and cover decompositions of hypergraphs ⋮ Greedy colorings of uniform hypergraphs ⋮ Partitioning the vertices of a cubic graph into two total dominating sets ⋮ 2-colorings in \(k\)-regular \(k\)-uniform hypergraphs ⋮ Not-all-equal and 1-in-degree decompositions: algorithmic complexity and applications ⋮ On 2-coloring certain \(k\)-uniform hypergraphs ⋮ Probabilistic methods in coloring and decomposition problems

Cites Work

• Every 7-regular digraph contains an even cycle
• Proof of the van der Waerden conjecture regarding the permanent of a doubly stochastic matrix
• Unnamed Item

This page was built for publication: Every 8-uniform 8-regular hypergraph is 2-colorable