Planner Graph

AI Summary

An AI-generated summary of this video lecture.

This educational video introduces planar graphs, defined as graphs drawable on a plane without edge crossings. The instructor uses a square with diagonals (K4) to show how a non-planar drawing can be transformed into a planar one. The lesson identifies K5 and K3,3 as fundamental non-planar graphs. Through visual demonstrations and mathematical derivations, the instructor proves their non-planarity using edge-vertex inequalities derived from Euler's formula. The lecture connects theoretical definitions with practical applications in engineering and circuit design.

Chapters

1. 0:00 – 2:00 00:00-02:00

   The video opens with a clear definition displayed on the screen: "Planer Graph: - A graph is called a planer graph if it can be drawn on a plan in such a way that no edges cross each other, otherwise it is called non-planer." The instructor highlights applications in civil engineering and circuit designing. He draws a square with vertices labeled a, b, c, and d, including both diagonals, which creates a crossing point in the center. He explains that while this drawing has crossings, the graph itself is planar. To prove this, he redraws the graph in red, keeping the outer square and one diagonal, but moving the other diagonal outside the square to avoid intersection. This visual transformation effectively demonstrates the core concept that planarity depends on the existence of a crossing-free drawing, not just any specific drawing. The labels a, b, c, and d are clearly visible at the corners of the square.

2. 2:00 – 5:00 02:00-05:00

   The instructor shifts focus to non-planar graphs, introducing the complete graph K5. He draws a pentagon with all diagonals connected, forming a star inside, and labels it "K5". He attempts to redraw this graph to eliminate crossings but shows that it is impossible, marking it with a red cross. Next, he introduces the complete bipartite graph K3,3. He draws a complex graph with six vertices and nine edges, attempting to rearrange the edges to avoid intersections. He writes down the vertex and edge counts for these graphs: for K5, he writes "5" for vertices and "10" for edges; for K3,3, he writes "6" for vertices and "9" for edges. These visual aids serve as the basis for the mathematical proofs that follow, establishing K5 and K3,3 as the minimal non-planar graphs. The red drawings show the instructor's struggle to find a planar embedding.

3. 5:00 – 7:15 05:00-07:15

   In the final segment, the instructor formalizes the non-planarity of K5 and K3,3 using mathematical inequalities. He writes the condition for a simple planar graph: E <= 3V - 6. He applies this to K5, substituting V=5 and E=10, resulting in the inequality 10 <= 9, which is false, thus proving K5 is non-planar. He then notes that for K3,3, the inequality 9 <= 12 holds true, so this condition alone is insufficient. He introduces a stricter condition for bipartite graphs: E <= 2V - 4. Applying this to K3,3 (V=6, E=9), he derives 9 <= 8, which is false. This mathematical proof confirms K3,3 is non-planar. The instructor concludes by summarizing that these two graphs are the fundamental obstructions to planarity. He also writes "min" under the inequalities to indicate minimum conditions.

The lecture effectively bridges the gap between visual intuition and mathematical rigor in graph theory. By starting with a simple definition and a tangible example of K4, the instructor makes the abstract concept of planarity accessible. The progression to K5 and K3,3 introduces the concept of forbidden minors. The final mathematical proofs provide the necessary tools for students to verify planarity without drawing, using edge and vertex counts. This structured approach ensures a deep understanding of why certain graphs are inherently non-planar.