Timeline for On planar graphs with specific spanning tree count and poly number of vertices
Current License: CC BY-SA 4.0
3 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 10 at 17:59 | comment | added | Jukka Kohonen | Cf. MO question 93656 where it was conjectured (empirically) that graphs of $o(\log(n))$ vertices exist that have $n$ spanning trees. (Planarity not mentioned though. | |
| Jul 10 at 4:31 | comment | added | Daniel Weber | It's easy to reduce this to the case of $i$ prime, but I'm not sure how to solve that | |
| Jul 9 at 23:16 | history | asked | Turbo | CC BY-SA 4.0 |