
Be the first to like this
Slideshare uses cookies to improve functionality and performance, and to provide you with relevant advertising. If you continue browsing the site, you agree to the use of cookies on this website. See our User Agreement and Privacy Policy.
Slideshare uses cookies to improve functionality and performance, and to provide you with relevant advertising. If you continue browsing the site, you agree to the use of cookies on this website. See our Privacy Policy and User Agreement for details.
Published on
In 1974 Paul Seymour conjectured that any graph G of order n and minimum degree at least (k−1)/k · n contains the (k − 1)th power of a Hamiltonian cycle. This conjecture was proved with the help of the Regularity Lemma – Blowup Lemma method for n ≥ n0 where n0 is very large. Here we present another proof that avoids the use of the Regularity Lemma and thus the resulting n0 is much smaller. The main ingredient is a new kind of connecting lemma.
Joint work with Asif Jamshed.
Clipping is a handy way to collect and organize the most important slides from a presentation. You can keep your great finds in clipboards organized around topics.
Be the first to comment