Show HN: 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
Summary not yet generated for this article.
Comments (0 of ) ⌛