Answers are grounded in this paper and cite their sources.
This research sharpens the lower bound of minimal edge weight sums in signed graphs, indicating improved bounds for graph structures.
Let G be a simple graph on n vertices with weights ± 1 on edges. Assume that for each edge e , the sum of the weights of the edges adjacent to e (including e itself) is positive. Let $$g(n)$$ be the minimal possible sum of edge weights in G . It is known that g(n)=(κ+o(1)) n² . We sharpen the lower bound of κ from $$-1/25$$ to $$-1/36$$ .
No takes yet. Share an insight, caveat, or question.
Prozorov et al. (2025) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: