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

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q124913579 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A parallel algorithmic version of the local lemma / rank
 
Normal rank
Property / cites work
 
Property / cites work: Every 8-uniform 8-regular hypergraph is 2-colorable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4004078 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithmic approach to the Lovász local lemma. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3682518 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4074927 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lopsided Lovász Local lemma and Latin transversals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3997075 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5734790 / rank
 
Normal rank
Property / cites work
 
Property / cites work: ON THE TWO-COLOURING OF HYPERGRAPHS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4763387 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Even Cycle Problem for Directed Graphs / rank
 
Normal rank

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

    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

    Identifiers