A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Equivalences between hamiltonicity and flow conjectures, and the sublinear defect property
2002
Discrete Mathematics
Preserved Fulltext
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.
doi:10.1016/s0012-365x(01)00372-7
fatcat:ku4scjy3jzawnfqoybuyf3frqa