Equivalences between hamiltonicity and flow conjectures, and the sublinear defect property Original Research Article

We show that many conjectures and theorems about graphs could be proved if one could show that they are true apart from some “errors”, provided that the number of these errors grows asymptotically slower than the order of these graphs.