ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let n⩾3n\geqslant 3 and let GG be a connected graph on nn nodes with at most

⌊(n2)2⌋\left\lfloor\frac{\binom{n}{2}}{2}\right\rfloor

edges. Write Pn,G\mathcal{P}_{n,G} for the corresponding graph invariant, and let HH range over graphs on at most n−1n-1 nodes. Polynomial dependence conjecture. Pn,G\mathcal{P}_{n,G} is a polynomial in some invariants Pn,H\mathcal{P}_{n,H} with HH ranging over graphs on at most n−1n-1 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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.