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

DOI10.1007/BF01864169MaRDI QIDQ2277485zbMATH OpenFDO

Authors Noga Alon, Z. Bregman

Publication date 1988

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

Full work available at URL https://doi.org/10.1007/BF01864169

zbMATH Keywords

coloringd-uniform d-regular hypergraph

Mathematics Subject Classification ID

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

Recommendations

• Hypergraph colouring and the Lovász local lemma
• Coloring and the Lovász local lemma
• Improved bounds and algorithms for hypergraph 2-coloring
• scientific article; zbMATH DE number 5825874
• 2-colorings in \(k\)-regular \(k\)-uniform hypergraphs

Cites work

• Every 7-regular digraph contains an even cycle
• scientific article; zbMATH DE number 3311772 (Why is no real title available?)
• Proof of the van der Waerden conjecture regarding the permanent of a doubly stochastic matrix

Cited in

(23)

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

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

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