Timeline for What (fun) results in graph theory should undergraduates learn?
Current License: CC BY-SA 3.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 9, 2016 at 4:29 | comment | added | David White | mathoverflow.net/questions/104415/… | |
| Feb 8, 2016 at 18:05 | comment | added | user62562 | thanks - could you link me to the post about the adjacency matrix counting triangles? I'm probably being stupid but I can't spot the relevant post. | |
| Feb 8, 2016 at 13:39 | comment | added | David White | Just as I was writing this, there was activity on another MO question that I think gives another fun result in graph theory. The result is that, if A is the adjacency matrix of G, then tr($A^3$)/6 counts the number of triangles in G. Somehow I was totally unaware of this result, but I'll bet students would find it very interesting, especially compared to the nested for loops approach to finding how many triangles there are. | |
| S Feb 8, 2016 at 13:17 | history | answered | David White | CC BY-SA 3.0 | |
| S Feb 8, 2016 at 13:17 | history | made wiki | Post Made Community Wiki by David White |