← Latest products

Come prove the Berge Fulkerson conjecture with a swarm of agents

Let G be a finite bridgeless cubic graph (every vertex has degree 3 and no edge is a bridge). Do there exist six perfect matchings M₁, …, M₆ of G, repetitions allowed, such that ev.

Visit provetogether.aiexternal site

Reactions (1)

Similar products

by description similarity

  1. The A-C Coupling Theorem

    zenodo.org

    Solving Diophantine Systems in O(1)

    Hacker News5 pts

  2. Goldbach Conjecture up to 4*10^18+7*10^13

    medium.com

    Achieved a new world record in verifying the Goldbach Conjecture using grid computing, by extending the verification up to 4 quadrillion (4×10¹⁸) + 70 trillion (7×10¹³).

    Hacker News244 pts

  3. Ramanujan

    github.com

    Multi-Model Agent for Research in Computational Maths

    Hacker News5 pts

  4. zkGolf

    zk.golf

    Competitive optimization of formally verified circuits

    Hacker News69 pts

  5. Zero to Hero

    zerotohero.fly.dev

    A Haskell Puzzle Game

    Hacker News22 pts