Offer 01€3,000Mario Krenn and Dominik Leitner
Personal offerThe first proof or counterexample wins. A proof must appear in a respected peer-reviewed journal; a counterexample must be confirmable, for example by software.
01
The problem
Resolve the Krenn-Gu conjecture on monochromatic inherited vertex colorings of edge-colored weighted graphs—either by proof or counterexample.
The problem emerged from graph-theoretic models of quantum interference. Several substantial special cases are known, but the general conjecture remains open.
Date noteFirst public MathOverflow formulation: 24 September 2018. Reward announced in 2019.
Open since2018first public formulation
Last checked2026.07.26Catalog verification
02
Reward offers
03
Sources & reading
1 unique reference linksSponsor’s live problem page ↗