Good explanations. Though, I see a little contradiction in one of the Hamiltonian Graphs that you showed at the beginning. According to Dirac's theorem, the degree of every vertex in the graph should be greater than or equal to n/2, though is not the case for a hamiltonian cycle you showed in the early explanation of what a hamiltonian cycle is (0:43). Vertex A has a degree of 2, n=6, which does not make 2>=3. Could you explain this please? Great video overall though!
Good question! Dirac's theorem only says that if a graph satisfies the condition (all vertex degrees are greater than or equal to n/2), then the graph is Hamiltonian, but a graph could be Hamiltonian without satisfying that condition, such as the graph at 0:43.
coming back to recomment, i watched this 2 hours before my discrete for compsci students final, u saved me lmao this was 3 questions on the test and i knew how it worked cause of u
![What are Centrality Indices? [Graph Theory]](http://i.ytimg.com/vi/HFP4Br7uvYo/mqdefault.jpg)
![What are Centrality Indices? [Graph Theory]](/img/tr.png)
![Guide to Walks, Trails, Paths, Circuits, and Cycles! [Graph Theory Tutorial]](http://i.ytimg.com/vi/hlHWguJVAdU/mqdefault.jpg)
0:00 - Hamiltonian Paths
0:21 - Hamiltonian Cycle
1:00 - Difficulty of finding Hamiltonian paths
1:25 - Grid graph special case
2:00 - Dirac's Theorem
2:39 - Ore's Theorem
3:20 - Connection btw theorems
3:55 - Intuition for Theorems
Thanks! It was a very clear and concise video.
Fast and simple! nice !
Good explanations. Though, I see a little contradiction in one of the Hamiltonian Graphs that you showed at the beginning. According to Dirac's theorem, the degree of every vertex in the graph should be greater than or equal to n/2, though is not the case for a hamiltonian cycle you showed in the early explanation of what a hamiltonian cycle is (0:43). Vertex A has a degree of 2, n=6, which does not make 2>=3. Could you explain this please?
Great video overall though!
Good question! Dirac's theorem only says that if a graph satisfies the condition (all vertex degrees are greater than or equal to n/2), then the graph is Hamiltonian, but a graph could be Hamiltonian without satisfying that condition, such as the graph at 0:43.
Thank you for the upload, dont see near enough vids on math topics outside algebra and calculus
Planning to do euler paths?
Thanks again!
Hello. Glad you liked the video! I will definitely have a video on Euler paths coming up soon, it will be my next video.
my kind of channel. just found it. post plenty, please.
Thanks for watching! Let me know if you have any questions or suggestions below.
yes, I do, Why are the explanation that great? Dude, I will fine you.
Nice. You should make another one with an implementation.
Thanks for the suggestion, I'll work on a video with an implementation in the near future 👍
thanks for cuting out the outro part I was about to mute my volume down 😂😂😂😂
great vid
coming back to recomment, i watched this 2 hours before my discrete for compsci students final, u saved me lmao this was 3 questions on the test and i knew how it worked cause of u