ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be an nn-vertex connected graph with chromatic number χ≥3\chi\geq 3. Let Tn,χT_{n,\chi} denote the complete χ\chi-partite graph of order nn whose part sizes differ by at most one. The quantity ABC(G){\rm ABC}(G) denotes the atom-bond connectivity index.

The complete multipartite extremal conjecture.

ABC(G)≤ABC(Tn,χ),{\rm ABC}(G)\leq {\rm ABC}(T_{n,\chi}),

with equality if and only if G≅Tn,χG\cong T_{n,\chi}.

This conjecture proposes that, among connected graphs with fixed order and chromatic number at least 33, the balanced complete multipartite graph maximizes the ABC index. The supplied text gives no resolution of the conjecture.

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.