Ore’s Theorem

[@bubusharma9135]

Night before Exam , Thank You , Less than 5 mins

[@vv9llb]

Theorem 4.4.2 - Ore's Theorem. Let G be graph with » vertices and let u and y be
non-adjacent vertices in G such that d(u) + d(v) 2 n. Let G + u denote the super graph
of G obtained by joining u and y by an edge. Then G is Hamiltonian if and only if G + uv
is Hamiltonian.

[@ondrejsluciak7826]

Why do you consider AD pair and also DA? It's the same pair. In the same manner you can consider BC and also CB.

[@richeyjay6648]

Yeah he’s a dunce

[@etnikgashi4144]

Thank you sir, very helpful

[@saransappa603]

Thank you. Nice explanation.

[@AnishShresthaonRoll]

nicely done mate

[@asthatrip2028]

Thank for ... From India

[@adempenver9416]

Great video explained well. Rather than saying that G is Hamiltonian I think you should say that G has a Hamiltonian circuit as couldn't saying that the graph is Hamiltonian also be interpreted as G may have a Hamiltonian circuit?

[@lovekumar7622]

Thanks brother

[@Anubis10110]

Thank you so much

[@ankitsharma-gs3rz]

excellent sir !!!!!1

[@hdjksa52]

Thanks

[@SamrattVerma]

thank u

[@darkofilipovski]

Thanks !!

[@TheNomadic69]

Not a proof

[@saransappa603]

Thank you. Nice explanation.

[@Maneleo]

thanks