ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let TT be an nn-vertex tree, and let sigma(T)sigma(T) and sigmat(T)sigma_t(T) denote its Albertson irregularity and sigmatsigma_t-irregularity, respectively. Let PnP_n be the path on nn vertices.

Tree irregularity inequality conjecture.

σt(T)≤(n−2)σ(T).\sigma_t(T)\leq (n-2)\sigma(T).

Equality holds if and only if TT is PnP_n.

The conjecture asks for an upper bound relating the modified irregularity to the Albertson irregularity for every tree on nn vertices, together with a characterization of the equality case. The supplied text does not state whether it has been resolved.

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.