There are a number of bugs in this presentation. Please proofread it and issue a corrected version. Green nodes are missing. A non-bipartite graph is called bipartite, then used as an example of a non-bipartite graph.
In Coloring section: should it be "It won’t be possible to color this cycle (and _therefore_ the entire graph)" ? It's quite clear that if we cannot color at least one cycle then whole graph cannot be.
The sentence where you say that the following graph is bipartite, right after defining what a bipartite graph is, is then followed by a diagram of a graph which is not bipartite.
Your ability to create clear illustrations to aid the learning process still amazes me to this day.
This is the perfect complement for the graph theory series!
This is heavily inspired on your series. Thank you so much for all the effort you put into educating others.
Excellent post
Gracias el miol!
errata - the example bipartite graph is drawn with an edge between two yellow nodes
Fixed
Thanks, we will fix ASAP
Wow, I just stumbled upon this and got totally engaged in it.
Here I am 30 minutes later having loved every minute of it.
That's why we do what we do. Thanks for reading, Mac. And please, share it with a friend :)
There are a number of bugs in this presentation. Please proofread it and issue a corrected version. Green nodes are missing. A non-bipartite graph is called bipartite, then used as an example of a non-bipartite graph.
I’m using an iPad with the latest OS.
Thanks for pointing these out.
The article contains an interesting section on Graph Coloring. BTW, knowledge of the Graph Theory is key to learning Graph Neural Networks..
100%
Keep these coming bro......
We will
This explanation nails the core concept very clear and well structured.
Thank you. Expect part 2 of the series soon.
This is so engaging with beautifully created visuals! Thank you for your effort. :)
1. 9
2. it becomes disconnected
3. 3
4. yes!!
In Coloring section: should it be "It won’t be possible to color this cycle (and _therefore_ the entire graph)" ? It's quite clear that if we cannot color at least one cycle then whole graph cannot be.
The sentence where you say that the following graph is bipartite, right after defining what a bipartite graph is, is then followed by a diagram of a graph which is not bipartite.
Maybe :)