ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a connected directed graph. An antimagic labeling is an edge labeling in which each label is a distinct element of {1,2,…,∣E∣}\{1,2,\dots,|E|\} and the oriented sums at the vertices are pairwise distinct, where an oriented sum is the sum of labels on edges directed away from the vertex minus the sum of labels on edges directed towards it. Directed Antimagic Graph Conjecture. Every connected directed graph except for the directed graphs K3K_3 and K1,2K_{1,2} admits an antimagic labeling. This directed analogue was suggested by Hefetz, Mütze, and Schwartz; the stated exceptions are the cyclic orientation of K3K_3 and the specified orientation of K1,2K_{1,2}.

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.