ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let G=(V,E)G=(V,E) be a connected graph with ∣V∣=n|V|=n, ∣E∣=m|E|=m, and let kk be a positive integer. Density-dependent antimagic conjecture. If Δ(G)=n−k\Delta(G)=n-k and m≥f(k)nm\geq f(k)n for some positive function ff, then GG is antimagic. This is motivated by the paper's result for Δ(G)=n−4\Delta(G)=n-4 and m≥7nm\geq7n, and by prior results for graphs of sufficiently large average degree; the source presents the statement as a conjecture and gives no resolution.

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.