Weekly2026-W452–8 Nov 202613 min read中文版
Unweighted network games cycle indefinitely, oriented half-covers hold, and ternary zero-sums settled
This week resolved several open questions in network games, directed graphs, fair resource allocation, and additive combinatorics. An explicit network game proved that players can cycle forever through profitable moves even without edge weights and with minimal teams. In graph theory, researchers established half-neighborhood coverage for oriented graphs with kernels in non-neighborhoods and disproved a conjectured cluster partition bound on subcubic networks. Other settled problems include a sharp threshold for three-dimensional zero-sum vector sequences and improved guarantees for dividing indivisible chores between two people.
Proved Unweighted network cut games admit endless cycles of minimal coalitional deviations
Proved Non-neighborhood kernels guarantee weighted half-neighborhood coverage in oriented graphs
Disproved Möbius ladder refutes component-order partition conjecture for subcubic graphs
Partial Minimal zero-sum sequence length in three-dimensional ternary space equals 13