Bandeira–Kireeva–Maillard–Rödder Kuramoto conjecture

For every ε>0\varepsilon>0, there exists a finite simple graph GG on nn vertices such that δ(G)(3/4ε)n\delta(G)\geq (3/4-\varepsilon)n and GG is not globally synchronizing for the Kuramoto model; equivalently, the Kuramoto energy on GG has a local minimum other than a fully synchronized state.

Progress summary

Solved

A new unrefereed preprint claims the conjecture is false by showing synchronization below the three-quarter connectivity threshold.

The conjecture, formalized as Conjecture 5 in BKMR25, asserts that the sharp minimum-degree threshold for global Kuramoto synchronization is 3/43/4: for every ε>0\varepsilon>0, some graph with minimum degree at least (3/4ε)n(3/4-\varepsilon)n is not globally synchronizing.

Known results

  • Taylor (2011): a 94%94\% minimum-degree condition suffices.
  • Bandeira, Ling, and Xu (2018): reduced the sufficient threshold to 79.3%79.3\%.
  • A 2020 result reduced it to 78.89%78.89\%.
  • Kassabov, Strogatz, and Townsend (2021): 3/43/4 suffices; lower-bound constructions reached roughly 68%68\%.

August 2026 claimed refutation

An August 2026 arXiv preprint claims that graphs with connectivity 3/4ε3/4-\varepsilon are globally synchronizing, thereby explicitly refuting the Bandeira–Kireeva–Maillard–Rödder conjecture. The claim has not yet been independently verified.

Current status (as of August 2026): The 3/43/4 upper bound and earlier lower bounds are established, while the conjecture is challenged by an unrefereed preprint whose claimed refutation remains unverified.

Sources
Sources & referencesView supporting material

Primary source

arXiv

Solutions 0

No solutions have been posted yet.