Written on the Wall II, Conjecture 2
Statement
For every finite simple connected graph , let denote the neighborhood of , let be the independence number of the subgraph induced by , and define the average local independence by . Let be the maximum number of leaves in a spanning tree of . Then ; equivalently, in the formalized notation, .
Record
- 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.