Harrington et al.'s unbounded exclusive-sum-number gap conjecture

Let ϵ(G)\epsilon(G) denote the exclusive sum number of a graph: the least rr such that GG together with rr isolated vertices has an exclusive sum labelling, meaning that the only working vertices are the added isolated vertices. Let sum(G)\operatorname{sum}(G) be the sum index. Harrington et al.'s conjecture. For every positive integer NN, there exists a graph GG such that

ϵ(G)sum(G)>N.\epsilon(G)-\operatorname{sum}(G)>N.

The conjecture asserts that the known upper bound of the sum index by the exclusive sum number can have an arbitrarily large gap. The paper says that it gives an explicit construction establishing this assertion.

Sources & referencesView supporting material

Primary source

John Haslegrave, “Sum index, difference index and exclusive sum number of graphs”, arXiv:2104.06959 (2023).

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.