Browsing by Subject "k-clique"
Now showing items 1-1 of 1
(Association for Computing Machinery (ACM), 2018)
Open AccessWe prove that for k ≪4√n regular resolution requires length nΩ(k) to establish that an Erdős–Rényi graph with appropriately chosen edge density does not contain a k-clique. This lower bound is optimal up to the multiplicative ...