Talk:Algorithmic Lovász local lemma

From Wikipedia, the free encyclopedia
Jump to: navigation, search
WikiProject Computer science  
WikiProject icon This article is within the scope of WikiProject Computer science, a collaborative effort to improve the coverage of Computer science related articles on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.
 ???  This article has not yet received a rating on the project's quality scale.
 ???  This article has not yet received a rating on the project's importance scale.
 

I found this article helpful and clearly written; thank you! 129.93.158.56 (talk) 23:38, 28 May 2010 (UTC)

History[edit]

I think Beck's work was specifically for a hypergraph bicolouring problem, where k is the maximum allowed intersection between edges. I think this should be specified, otherwise k is not defined?--Matt Kwan (talk) 05:37, 6 July 2014 (UTC)