Monthly Archives: August 2020

Why Venn diagram of 4 random sets does not exist

We see Venn diagram representation of 3 sets all the time. But when it comes to 4 sets its not possible to show all possible intersection on a paper because the intersection is not planar. We use algebraic techniques like … Continue reading

Posted in Combinatorics, Graph Theory, Proof | Tagged | Leave a comment

Proof of Euler’s formula for Planar Graph

Euler’s formula for Planar Graph is one of the most important formula in Graph theory and it can be easily proved by Mathematical Induction.  The main point in the proof is as we add an extra edge it can either … Continue reading

Posted in Combinatorics, Graph Theory, Mathematical Induction, Proof, Topology | Tagged | Leave a comment

Fun Warm Up Problem

There is a forest and among the many trees there is an apple tree. Then there happened a hurricane. Before the hurricane there were apples on the tree, after the hurricane there were no apples on the tree and no … Continue reading

Posted in Puzzle, Trick | Tagged , | Leave a comment

Some Hasse Diagrams and their Posets

Hasse Diagrams are a compact way of representing Posets. We know that for a set to be Poset it has to be Reflexive, Antisymmetric and Transitive. One should know how to convert back and forth between Hasse diagram and the … Continue reading

Posted in Abstract Algebra, Graph Theory, Set Theory | Tagged | Leave a comment

Equivalent Vs Partially Ordered

Posted in Abstract Algebra, Set Theory | Leave a comment

Equivalence Class and Partitions

Posted in Abstract Algebra, Set Theory | Leave a comment

Why Klien 4 is not a Cyclic Group

Posted in Abstract Algebra | Leave a comment

Problems from Gallian Chapter 1 # 29

Posted in Abstract Algebra | Tagged , | Leave a comment

Problems from Gallian Chapter 1 # 27

Posted in Abstract Algebra, Proof | Tagged , | Leave a comment

Problems from Gallian Chapter 1 # 26

Posted in Abstract Algebra | Tagged , | Leave a comment