wow, i study a lot with RUclips and already visited a lot of channels doing tutorials, but this channel is amazing! Never saw such a good explanation video, thanks!
Sir, please do you make a video series on other combinatorial theorems? like ,Ramsey theorem, Schurs theorm,, Dilworth's theorem, Erdos ko rado, Sperners theorem etc. Thank you very much for this video. I am really grateful
I currently only do graph theory. If I ever have extra time I might get to some matroids or Ramsey theory, but only graphs currently. Thanks for watching!
This channel is devoted to usage, rather than proof. I'm sure there are other channels (or textbooks) out there that can give you the proof. If I have extra time some day I may start including more proofs on this channel. Thanks for watching!
Holy cow you actually explained it instead putting a bunch of pretentious symbols that nobody cares to remember THANK YOU!
Everything about Hall's theorem make sense now
Glad I could help!
I’ve rarely seen such a good and concise explanation. Thanks a lot!
Well, that was easy. Graph Theory for Educators? Looks like my Educators need this video! Thank you Jessie!
wow, i study a lot with RUclips and already visited a lot of channels doing tutorials, but this channel is amazing! Never saw such a good explanation video, thanks!
I don't think an explanation can be more clear than this. Excellent examples, thanks!
omg the best video for hall's theorem so far
Glad you enjoyed it. Thanks for watching.
Hey mate, cheers for the video. You've explained it really well for me to undestand it.
This was so concise! Thanks for showing actual examples :D
Great work. Thank you.
most helpful video i've watched so far, thanks a ton
Thanks! This was GREAT!
Thank you sir, .... from India😃😃😃
Big ups to you mate, very well explained.
Thank you, very helpful
Thanks alot for that very helpfull clip
Thanks very much!
No problem. Glad it was helpful.
Thanks for this informative video!
Glad it was helpful.
I understood but its hard to find counter examples sometimes
awesome, this is the last video that I watch before final
Thanks, explained it better than my book or prof!
No problem. Glad it was useful.
Glad it helped!
+1
wow!! Great explanation
Very good explanation, thank you sir!
Thank you.
wow what a good explanation, u made that sound so easy, Thanks!
thank you! great video!
Sir, please do you make a video series on other combinatorial theorems? like ,Ramsey theorem, Schurs theorm,, Dilworth's theorem, Erdos ko rado, Sperners theorem etc.
Thank you very much for this video. I am really grateful
I currently only do graph theory. If I ever have extra time I might get to some matroids or Ramsey theory, but only graphs currently. Thanks for watching!
Good work man. Thanks.
chup kr chobu
What can one do with all of this then? Is this just theoretical mathematics?
amazing!!!!!!!!!!
helped a lot thank you
thanks!!
You're welcome!
thx
Hi
where is the proof? you are just showing how to use it, please upload a video with proof :)
This channel is devoted to usage, rather than proof. I'm sure there are other channels (or textbooks) out there that can give you the proof. If I have extra time some day I may start including more proofs on this channel. Thanks for watching!
what if in example 3,
X = {A,D}, so, N(X) = {3},
So, |N(X)| = 1, and |X| = 2.
Which violates Hall's theorem.. The answer should be NO.
Hi Rahul, in example 3, if X = {A,D}, then N(X) = {1,2,3}, which satisfies Hall's Theorem. You may want to go back and double check the example.
thanks!