Timeline for Is there a matrix whose permanent counts 3-colorings?
Current License: CC BY-SA 4.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| S Aug 5, 2020 at 11:49 | history | edited | Glorfindel | CC BY-SA 4.0 |
added the reference links
|
| S Aug 5, 2020 at 11:49 | history | suggested | vidyarthi | CC BY-SA 4.0 |
added the reference links
|
| Aug 5, 2020 at 11:37 | review | Suggested edits | |||
| S Aug 5, 2020 at 11:49 | |||||
| Apr 30, 2015 at 14:57 | comment | added | Adam P. Goucher | A la Tait, this means we can count the number of vertex 4-colourings of a fully-triangulated planar graph using the permanent of a matrix. | |
| Feb 16, 2010 at 9:28 | history | edited | Gjergji Zaimi | CC BY-SA 2.5 |
added 4 characters in body
|
| Feb 16, 2010 at 9:03 | history | answered | Gjergji Zaimi | CC BY-SA 2.5 |