2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/31358We present a new structural (or syntatic) approach for estimating the satisfiability threshold of random 3-SAT formulae. We show its efficiency in obtaining a jump from the previous upper bounds, lowering them to 4.506. The method combines well with other techniques, and also applies to other problems, such as the 3-colourability of random graphs.Discrete MathematicsComputational ComplexityG.2.1text