Polynomial dependence of sparse connected graph invariants on smaller graphs
Statement
Let and let be a connected graph on nodes with at most
edges. Write for the corresponding graph invariant, and let range over graphs on at most nodes. Polynomial dependence conjecture. is a polynomial in some invariants with ranging over graphs on at most nodes. This proposes a reduction of the invariants associated with sufficiently sparse connected graphs to invariants arising from graphs with fewer nodes; the supplied text gives no resolution status.
Record
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.