Bipartite graphs with minimum degree at least 15 are antimagic

Kecai Deng

An antimagic {labeling} of a graph $G=(V,E)$ is a one-to-one mapping $f:E\to \{1,2,\dots ,|E|\}$, ensuring that the vertex sums in $V$ are pairwise distinct, where a vertex…