On the paper of Pascal Schweitzer concerning similarities between incompressibility methods and the Lovász local lemma

DOI10.1016/j.ipl.2011.01.013zbMath1260.68138OpenAlexW2026820024WikidataQ124817585 ScholiaQ124817585MaRDI QIDQ1944918

Miroslava Kemeňová, Tomáš Kulich

Publication date: 28 March 2013

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2011.01.013

zbMATH Keywords

algorithmsdata compressionRamsey theoryincompressibilityLovász local lemma

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Ramsey theory (05D10)

Cites Work

• Using the incompressibility method to obtain local Lemma results for Ramsey-type problems
• An application of Lovász' local lemma-A new lower bound for the van der Waerden number
• A constructive proof of the general lovász local lemma
• Unnamed Item
• Unnamed Item

This page was built for publication: On the paper of Pascal Schweitzer concerning similarities between incompressibility methods and the Lovász local lemma