Timeline for Number of spanning forests in a graph
Current License: CC BY-SA 3.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 2, 2011 at 13:22 | comment | added | Simon | @Aleks Not a problem. I knew it probably wasn't what you were after, but I put in my 2c when I can. If you liked the Feynman graph paper, then I suggest you have a look at Nakanishi. In a sense, arXiv:1002.3458 is just a shortened version of Nakanishi updated to use dimensional regularization. | |
| Jun 1, 2011 at 5:59 | comment | added | Aleks Vlasev | Thanks Simon, the Feynman graph polynomials paper is the first one I consulted when I looked at the problem. Thank you for the help! That Mathematica demonstration looks great! | |
| Jun 1, 2011 at 0:53 | history | edited | Simon | CC BY-SA 3.0 |
deleted 1 characters in body
|
| Jun 1, 2011 at 0:35 | history | edited | Simon | CC BY-SA 3.0 |
added 75 characters in body
|
| Jun 1, 2011 at 0:28 | history | answered | Simon | CC BY-SA 3.0 |