In my Graph Theory course, we were told that complete graphs are denoted with K for Kuratowski, who proved that a graph was planar if and only if it had no subgraph that could be homomorphically reduced to K_5 or K_3,3
As far as I know there are two contradictory stories regarding the K; the Kuratowski one is one of them: Try the math stackexchange question 400203. Not sure which one is true, but I give "komplett" the edge 😃
In my Graph Theory course, we were told that complete graphs are denoted with K for Kuratowski, who proved that a graph was planar if and only if it had no subgraph that could be homomorphically reduced to K_5 or K_3,3
As far as I know there are two contradictory stories regarding the K; the Kuratowski one is one of them: Try the math stackexchange question 400203. Not sure which one is true, but I give "komplett" the edge 😃
thank you!!! Great explanation!
Welcome; its such a cute topic, so I am glad that you liked it ☺
Very interesting
Thanks for the comment, I am glad you think so!
thanks!
You are very welcome