2 problems

Computational-threshold conjecture. The computational transition for sampling $q$-colourings in simple hypergraphs should occur around the same threshold as the local lemma; in par…

A witness tree is built from bad-event labels, with children of a node labeled $B$ required to have distinct labels $B_1,\dots,B_s$ whose set is orderable to $B$. For a tree-struct…