Hefetz–Mütze–Schwartz conjecture on antimagic orientations

Let GG be a connected undirected graph. An antimagic orientation consists of an orientation DD of GG and a bijection from E(G)E(G) to {1,2,,E(G)}\{1,2,\ldots,|E(G)|\} such that the vertex sums, defined as the sum of labels on incoming edges minus the sum of labels on outgoing edges, are distinct for all vertices. Hefetz–Mütze–Schwartz conjecture. Every connected graph admits an antimagic orientation. The source states that this remains an unsolved question, although many graph families are known to satisfy it.

Sources & referencesView supporting material

Primary source

Eranda Dhananjaya and Wei-Tian Li, “Every connected graph admits a local antimagic orientation and almost every graph admits an antimagic orientation”, arXiv:2402.10472 (2024).

Additional references

9 papers in this index state this conjecture (2015–2024). The statement above is taken from the most recent of them; the others are arXiv:2111.03809, arXiv:2012.10087, arXiv:1909.10928, arXiv:1908.06072, arXiv:1812.06715, arXiv:1811.01904, arXiv:1707.03507, arXiv:1510.05070.

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.