Hypergraph colouring and the Lovász local lemma (Q1356486): Difference between revisions

Latest revision as of 13:09, 27 May 2024

scientific article

Language	Label	Description	Also known as
English	Hypergraph colouring and the Lovász local lemma	scientific article

Statements

instance of

scholarly article

0 references

title

Hypergraph colouring and the Lovász local lemma (English)

0 references

published in

Discrete Mathematics

0 references

publication date

17 August 1997

0 references

review text

The Lovász local lemma about hypergraph coloring is used to prove the following result: let \(H\) be a hypergraph in which every edge contains at least \(k\) points and meets at most \(d\) other edges. If \(e(d+2)\leq 2^k\) then \(H\) has a 2-coloring.

0 references

zbMATH Keywords

Lovász local lemma

0 references

hypergraph coloring

0 references

author

Colin J. H. McDiarmid

0 references

reviewed by

Vladimir D. Tonchev

0 references

MaRDI profile type

MaRDI publication profile

0 references

cites work

A parallel algorithmic version of the local lemma

0 references

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

0 references

Q4004078

0 references

An algorithmic approach to the Lovász local lemma. I

0 references

Q3682518

0 references

Q4074927

0 references

Lopsided Lovász Local lemma and Latin transversals

0 references

Q3997075

0 references

Q5734790

0 references

ON THE TWO-COLOURING OF HYPERGRAPHS

0 references

Q4763387

0 references

The Even Cycle Problem for Directed Graphs

0 references

Identifiers

zbMATH Open document ID

0873.05067

0 references

DOI

10.1016/S0012-365X(96)00249-X

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:1356486

@@ Property / author @@
-Q234397
@@ Property / author: Q234397 / rank @@
-Normal rank
@@ Property / reviewed by @@
-Vladimir D. Tonchev
@@ Property / reviewed by: Vladimir D. Tonchev / rank @@
-Normal rank
@@ Property / author @@
+Colin J. H. McDiarmid
@@ Property / author: Colin J. H. McDiarmid / rank @@
+Normal rank
@@ Property / reviewed by @@
+Vladimir D. Tonchev
@@ Property / reviewed by: Vladimir D. Tonchev / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / Wikidata QID @@
+Q124913579
@@ Property / Wikidata QID: Q124913579 / rank @@
+Normal rank
@@ Property / cites work @@
+A parallel algorithmic version of the local lemma
@@ Property / cites work: A parallel algorithmic version of the local lemma / rank @@
+Normal rank
@@ Property / cites work @@
+Every 8-uniform 8-regular hypergraph is 2-colorable
+Normal rank
@@ Property / cites work @@
+Q4004078
@@ Property / cites work: Q4004078 / rank @@
+Normal rank
@@ Property / cites work @@
+An algorithmic approach to the Lovász local lemma. I
+Normal rank
@@ Property / cites work @@
+Q3682518
@@ Property / cites work: Q3682518 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4074927
@@ Property / cites work: Q4074927 / rank @@
+Normal rank
@@ Property / cites work @@
+Lopsided Lovász Local lemma and Latin transversals
+Normal rank
@@ Property / cites work @@
+Q3997075
@@ Property / cites work: Q3997075 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5734790
@@ Property / cites work: Q5734790 / rank @@
+Normal rank
@@ Property / cites work @@
+ON THE TWO-COLOURING OF HYPERGRAPHS
@@ Property / cites work: ON THE TWO-COLOURING OF HYPERGRAPHS / rank @@
+Normal rank
@@ Property / cites work @@
+Q4763387
@@ Property / cites work: Q4763387 / rank @@
+Normal rank
@@ Property / cites work @@
+The Even Cycle Problem for Directed Graphs
@@ Property / cites work: The Even Cycle Problem for Directed Graphs / rank @@
+Normal rank