L48: 5-Color Theorem Proof using Mathematical Induction Method | Discrete Mathematics Lectures Hindi

Full Course of Discrete Mathematics: • Discrete Mathematics L...
In this video you can learn about 5-Color Theorem Proof using Mathematical Induction Method in Foundation of Computer Science Course. Following topics of Discrete Mathematics Course are discusses in this lecture: 5-Color Theorem Proof using Mathematical Induction Method. This topic is very important for College University Semester Exams and Other Competitive exams like GATE, NTA NET, NIELIT, DSSSB tgt/ pgt computer science, KVS CSE, PSUs etc
5-Color Theorem Proof using Mathematical Induction Method - Graph Theory Lectures
Discrete Mathematics - Graph Theory Video Lectures in Hindi for B.Tech, M.Tech, MCA Students
👉 Follow us on Social media:
Facebook: tiny.cc/ibdrsz
▶️ Links for Hindi playlists of all subjects are:
Data Structure: tiny.cc/lkppsz
DBMS : tiny.cc/zkppsz
Java: tiny.cc/1lppsz
Control System: tiny.cc/3qppsz
Computer Network Security: tiny.cc/6qppsz
Web Engineering: tiny.cc/7qppsz
Operating System: tiny.cc/dqppsz
EDC: tiny.cc/cqppsz
TOC: tiny.cc/qqppsz
Software Engineering: tiny.cc/5rppsz
DCN: tiny.cc/8rppsz
Data Warehouse and Data Mining: tiny.cc/yrppsz
Compiler Design: tiny.cc/1sppsz
Information Theory and Coding: tiny.cc/2sppsz
Computer Organization and Architecture(COA): tiny.cc/4sppsz
Discrete Mathematics (Graph Theory): tiny.cc/5sppsz
Discrete Mathematics Lectures: tiny.cc/gsppsz
C Programming: tiny.cc/esppsz
C++ Programming: tiny.cc/9sppsz
Algorithm Design and Analysis(ADA): tiny.cc/fsppsz
E-Commerce and M-Commerce(ECMC): tiny.cc/jsppsz
Adhoc Sensor Network(ASN): tiny.cc/nsppsz
Cloud Computing: tiny.cc/osppsz
STLD (Digital Electronics): tiny.cc/ysppsz
Artificial Intelligence: tiny.cc/usppsz
Links for #GATE/#UGCNET/ PGT/ TGT CS Previous Year Solved Questions:
UGC NET : tiny.cc/brppsz
DBMS GATE PYQ : tiny.cc/drppsz
TOC GATE PYQ: tiny.cc/frppsz
ADA GATE PYQ: tiny.cc/grppsz
OS GATE PYQ: tiny.cc/irppsz
DS GATE PYQ: tiny.cc/jrppsz
Network GATE PYQ: tiny.cc/mrppsz
CD GATE PYQ: tiny.cc/orppsz
Digital Logic GATE PYQ: tiny.cc/rrppsz
C/C++ GATE PYQ: tiny.cc/srppsz
COA GATE PYQ: tiny.cc/xrppsz
DBMS for GATE UGC NET : tiny.cc/0tppsz

[@kaiftokare6972]

Thank you for providing this entire playlist 👍🏼 It helped a lot ❤️

[@tianle3325]

The proof did not use mathematical language. "Direct edge" is really called a "path". The property used to prove v1,v2,v3,v4,v5 cannot have 5 colors is that they need to have paths between all of them to use 5 colors. But this will cause a subgraph homeomorphic to K5 And A graph is non-planar if and only if it contains a subgraph homeomorphic to K5

[@kaustavmukherjee8844]

you stated the converse of Kuratowski's theorem, which i suspect might not be true. The actual theorem is "It states that a finite graph is planar if and only if it does NOT contain a subgraph that is a subdivision of K5 (the complete graph on five vertices) or of K3,3 (a complete bipartite graph on six vertices, three of which connect to each of the other three, also known as the utility graph)"

[@reenakalakar]

thank you sir, but i requesting to u, pls make vedio for automorphism,homomorphism.

[@raviRj05]

End m chutiya bna rhe ho guru

[@vincentjonathan]

Why must 5 colours? Why don't we use 3 colours? (v=pink; v1&v2&v3&v4 = green; v5=orange)

[@Shrunkhla]

I think we can have an edge between v4 and v5 internally without intersection

[@bucky3300]

But we can't have an edge btw v1 n v4 ig

[@prithwishmaiti2118]

Wrong proof

[@alishawayal7470]

How?

[@SouLJToP]

let G be a connected graph and u v be two adjacent vertices in G. Show that if N(u) - {v} = N(v) - {u} , then e(u) = e(v). Sir ye vala sum solution ka video banao please

[@muhammedakbar2015]

Thank you so much sir ❤

[@lathar6966]

English subtitles plz

[@jagannathdansana6715]

thank you sir.

[@clairvoyancechishanga3129]

y not use english...???????????

[@jacobblack2544]

Samajh to aagaya par paper me kaise likhna hai?

[@teacherHub6723]

If G is a tree, and all the degrees of the vertices in G are odd, show that the number of edges in G is odd. Pls solve the problem

[@dheerajgupta9124]

But an edge can be drawn between v4 and v5 without crossing other edge 🤔... I'm not clear at the end.

[@adarshtiwari2254]

Actually you can draw with the orange but not with the green

[@nameless2850]

Can do with greet too

[@abhiramrajeevan]

His drawing was incorrect if there is an edge betweeen v3 and v5 we should change v3 to green rather than changing v5 from purple.

[@DeepakKumar-wv7jg]

Sir algebraic structures ka veideo kab tak milega

[@smurmu27]

Sir. Last me v4 ka smjh me nhi aaya.

[@georgelaing2578]

You should provide subtitles.

[@manasbanjare3198]

I don't think u make the proof understandable at last, bcoz b/w V4 and V3 there is edge possible

[@rashigupta2197]

Mujhe samjh nhi aya ye topic

[@IbrahimAli-mj8ye]

Sir, Can You Provide the notes also

[@025-harshbindal7]

Worst explanation

[@alishawayal7470]

Thank you sir