[Discrete Mathematics] Hamilton Cycles

  Рет қаралды 74,038

TrevTutor

TrevTutor

Күн бұрын

We introduce the concept of Hamilton Cycles in Graph Theory.
Visit our website: bit.ly/1zBPlvm
Subscribe on KZbin: bit.ly/1vWiRxW
-Playlists-
Discrete Mathematics 1: • Discrete Math (Sets, L...
Discrete Mathematics 2: • Discrete Math (Countin...
-Recommended Textbooks-
Discrete and Combinatorial Mathematics (Grimaldi): amzn.to/2T0iC53
Discrete Mathematics (Johnsonbaugh): amzn.to/2Hh7H41
Discrete Mathematics and Its Applications (Rosen): amzn.to/3lUgrMI
Book of Proof (Hammack): amzn.to/35eEbV... us on Facebook: on. 1vWwDRc
Submit your questions on Reddit: bit.ly/1GwZZrP
We introduce Hamilton cycles, sort of similar to Euler Circuits.
Hello, welcome to TheTrevTutor. I'm here to help you learn your college courses in an easy, efficient manner. If you like what you see, feel free to subscribe and follow me for updates. If you have any questions, leave them below. I try to answer as many questions as possible. If something isn't quite clear or needs more explanation, I can easily make additional videos to satisfy your need for knowledge and understanding.

Пікірлер: 25
@tyroneslothdrop9155
@tyroneslothdrop9155 9 жыл бұрын
You're doing great work on this channel. I hope you continue to focus on advanced mathematics in the future because that is what's most lacking in the KZbin-verse.
@Trevtutor
@Trevtutor 9 жыл бұрын
Tyrone Slothdrop I'm planning on moving into Linear Algebra, then hopefully some Group Theory, Rings, and Fields afterwards. We'll see how things go. Working on a side project at the moment off the channel. Big plans!
@imazsurve3290
@imazsurve3290 2 жыл бұрын
this playlist was very helpful. Thanks a ton!!!
@buibui__
@buibui__ 4 жыл бұрын
For the 8:10 is it wrong for the vertex at the last go back to the a just because it is bipartite graph which cannot gone through it's own vertex again?
@KansasFashion
@KansasFashion 6 жыл бұрын
Love you man
@gor3947
@gor3947 Жыл бұрын
lav poshmaneci(
@kiana6672
@kiana6672 7 жыл бұрын
Hi Trev, how come you don't go into more depth for this topic? The textbook has a larger scope and depth, and the questions in MACM 201 go beyond what this intro video teaches. All your other topics were much more exhaustive.
@محمدالصانبي-ل1س
@محمدالصانبي-ل1س 3 ай бұрын
Hi, where can I go into more depth for this graph topic on KZbin
@PrakashBesra
@PrakashBesra 8 жыл бұрын
A Hamiltonian cycle, also called a Hamiltonian circuit, Hamilton cycle, or Hamilton circuit, is a graph cycle (i.e., closed loop) through a graph that visits each node exactly once.
@ARNAKLDO
@ARNAKLDO 5 жыл бұрын
Prakash Besra what about the initial node? it is visited twice once the cycle is created does it not?
@gor3947
@gor3947 Жыл бұрын
cavt tanem dzec
@mageboyd619
@mageboyd619 6 жыл бұрын
Did u go to SFU?
@Trevtutor
@Trevtutor 6 жыл бұрын
Just a total coincidence that the courses match MACM 101 and MACM 201. ;P
@mageboyd619
@mageboyd619 6 жыл бұрын
LOL macm 201 final in 2 hrs thanks for all your hard work!!
@grasshopperweb
@grasshopperweb 4 жыл бұрын
my combinatorics class does all the proofs :( a little disappointed you didn't cover those.
@daisyd5168
@daisyd5168 5 жыл бұрын
Hi Trev, but does |V_a|=|V_b| guarantee a Hamilton cycle in a bipartite graph? I don't think so.
@RichardZamoraTheArtsareAwesome
@RichardZamoraTheArtsareAwesome 4 жыл бұрын
A bipartite with equal amount of nodes that have same degree I believe guarantee a hamilton cycle
@krishnaswaroop9293
@krishnaswaroop9293 5 жыл бұрын
Thanx sir, the bipartite graph result was very helpful..
@mikeegayon2942
@mikeegayon2942 8 жыл бұрын
is hamiltonian cycle and hamiltonian circuit are the same?
@Kamnuma
@Kamnuma 7 жыл бұрын
Yes, I think..
@KaranKumar-js8bx
@KaranKumar-js8bx 6 жыл бұрын
yup
@abhisheksharma-tq8xg
@abhisheksharma-tq8xg 9 жыл бұрын
are hamilton cycle and hamilton path same? plz rply
@MrSidd12
@MrSidd12 8 жыл бұрын
+abhishek sharma if the starting and ending point are same then it is a cycle otherwise it is a path.
@holly3802
@holly3802 6 жыл бұрын
Hi! You say around 11:15 that the graph has a Hamilton cycle because Va = Vb. But that isn't sufficient to prove the existence of one I think. What if a bipartite graph with equal independent sets of vertices had a cut edge? I mean, I know the graph you gave has a Ham cycle, but I think it's over-generalizing to say "because Va = Vb" since that's not always true. I could be wrong though, I am new to this.
@TheWhinoceros
@TheWhinoceros 6 жыл бұрын
Yeah, Trev got that one part wrong. A very simple graph with 4 vertices: o -- o -- o -- o, is bipartite and Va = Vb, but the graph clearly does not have a Hamilton cycle. I only know this now because I thought Va = Vb was sufficient to prove the existence of a Hamilton cycle, and lost marks on a quiz! Damn it Trev! Haha
[Discrete Mathematics] Graph Coloring and Chromatic Polynomials
13:05
Hamiltonian Cycles, Graphs, and Paths | Hamilton Cycles, Graph Theory
11:54
Minecraft Creeper Family is back! #minecraft #funny #memes
00:26
отомстил?
00:56
История одного вокалиста
Рет қаралды 7 МЛН
Every parent is like this ❤️💚💚💜💙
00:10
Like Asiya
Рет қаралды 13 МЛН
[Discrete Mathematics] Planar Graphs
21:03
TrevTutor
Рет қаралды 112 М.
[Discrete Mathematics] Dijkstra's Algorithm
11:41
TrevTutor
Рет қаралды 66 М.
Euler and Hamiltonian paths and circuits
10:18
CBlissMath
Рет қаралды 22 М.
Stop Trying To Understand
10:43
The Math Sorcerer
Рет қаралды 428 М.
ISOMORPHISMS and BIPARTITE GRAPHS - DISCRETE MATHEMATICS
16:58
TrevTutor
Рет қаралды 203 М.
[Discrete Mathematics] Euler's Theorem
18:36
TrevTutor
Рет қаралды 75 М.
Example: Proving a graph has no Hamilton cycle
16:23
Scott Annin
Рет қаралды 1,6 М.
Existence of Eulerian Paths and Circuits | Graph Theory
9:41
WilliamFiset
Рет қаралды 50 М.
The World's Best Mathematician (*) - Numberphile
10:57
Numberphile
Рет қаралды 7 МЛН
[Discrete Mathematics] Minimal Cuts
12:33
TrevTutor
Рет қаралды 36 М.
Minecraft Creeper Family is back! #minecraft #funny #memes
00:26