ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let G=(V,E)G=(V,E) be a connected graph with ∣V∣=n|V|=n, and let xx be a vertex such that d(x)=Δ(G)=n−kd(x)=\Delta(G)=n-k for some k≥4k\geq4. Alon et al.'s large-maximum-degree conjecture. If n≥n0(k)n\geq n_0(k) for some n0(k)n_0(k), then GG is antimagic. This conjecture extends known antimagic results for maximum degree n−2n-2 and n−3n-3; the source explicitly states that it remains open.

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.