Hypergraph colouring and the Lovász local lemma (Q1356486)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1018535
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Hypergraph colouring and the Lovász local lemma |
scientific article; zbMATH DE number 1018535 |
Statements
Hypergraph colouring and the Lovász local lemma (English)
0 references
17 August 1997
0 references
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
Lovász local lemma
0 references
hypergraph coloring
0 references
0.9190348386764526
0 references
0.8751441240310669
0 references
0.862757682800293
0 references
