Mario Krenn is offering $€3,000$ (roughly $3,300) for the answer of a question on graph colorings, which are derived from the perfect matchings of the graph. The specific question deals with the existence of monochromatic colorings of edge-colored weighted graphs. The question has been asked here at MathOverflow a year ago, and the link to the reward was added recently.

Mario Krenn is offering $€3,000$ (roughly $3,300) for the answer of a question on graph colorings, which are derived from the perfect matchings of the graph. It was recently described by Dustin Mixon.

The specific question deals with the existence of monochromatic colorings of edge-colored weighted graphs. The question has been asked here at MathOverflow a year ago, and the link to the reward was added recently.