Minimal graphs with a prescribed number of spanning trees
Statement
Conjecture Let be an integer and let denote the least integer such that there exists a simple graph on vertices having precisely spanning trees. Then
Record
- Source
- Added
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.